Merge branch 'master' of github.com:cch123/leetcode-rust

Author: cch123

S0789-escape-the-ghosts/Cargo.lock

@@ -0,0 +1,7 @@
+[package]
+name = "S0789-escape-the-ghosts"
+version = "0.1.0"
+authors = ["xargin <cao1988228@163.com>"]
+edition = "2018"
+
+[dependencies]

S0789-escape-the-ghosts/Cargo.toml

@@ -0,0 +1,22 @@
+struct Solution;
+
+impl Solution {
+    pub fn escape_ghosts(ghosts: Vec<Vec<i32>>, target: Vec<i32>) -> bool {
+        // 只要本体和目标的距离 < 任何一个 ghost 到目标的距离，就可以获胜
+        // 否则的话 ghost 可以选择行动模式：
+        //    1.先不管本体，直接走到终点
+        //    2.这样不管本体怎么走，最终都没法获胜了
+        let target_dist = target[0].abs() + target[1].abs();
+        let mut res = true;
+        ghosts.iter().for_each(|g|{
+            if (g[0]-target[0]).abs() + (g[1]-target[1]).abs() < target_dist {
+                res = false;
+            }
+        });
+
+        res
+    }
+}
+
+fn main() {
+}

S0789-escape-the-ghosts/src/main.rs

@@ -0,0 +1,7 @@
+[package]
+name = "S0817-linked-list-components"
+version = "0.1.0"
+authors = ["xargin <cao1988228@163.com>"]
+edition = "2018"
+
+[dependencies]

S0817-linked-list-components/Cargo.lock

@@ -0,0 +1,48 @@
+struct Solution;
+// Definition for singly-linked list.
+ #[derive(PartialEq, Eq, Debug)]
+ pub struct ListNode {
+   pub val: i32,
+   pub next: Option<Box<ListNode>>
+ }
+
+ impl ListNode {
+   #[inline]
+   fn new(val: i32) -> Self {
+     ListNode {
+       next: None,
+       val
+     }
+   }
+ }
+use std::collections::HashSet;
+impl Solution {
+    pub fn num_components(head: Option<Box<ListNode>>, g: Vec<i32>) -> i32 {
+        let mut cur = head;
+        let mut passing_component = false;
+        let set = g.iter().collect::<HashSet<_>>();
+        let mut res = 0;
+        while cur.is_some() {
+            if passing_component == false {
+                if set.contains(&cur.as_ref().unwrap().val) {
+                    passing_component = true;
+                }
+            } else {
+                if !set.contains(&cur.as_ref().unwrap().val) {
+                    passing_component = false;
+                    res += 1;
+                }
+            }
+            cur = cur.unwrap().next;
+        }
+
+        if passing_component == true {
+            return res + 1;
+        }
+        res
+    }
+}
+
+fn main() {
+    println!("Hello, world!");
+}

S0817-linked-list-components/Cargo.toml

@@ -0,0 +1,7 @@
+[package]
+name = "S0977-squares-of-a-sorted-array"
+version = "0.1.0"
+authors = ["xargin <cao1988228@163.com>"]
+edition = "2018"
+
+[dependencies]

S0817-linked-list-components/src/main.rs

@@ -0,0 +1,12 @@
+struct Solution;
+impl Solution {
+    pub fn sorted_squares(a: Vec<i32>) -> Vec<i32> {
+        let mut res = a.iter().map(|x|(*x)*(*x)).collect::<Vec<_>>();
+        res.sort();
+        res
+    }
+}
+
+fn main() {
+    println!("Hello, world!");
+}