feat: module

Author: jtr109

Cargo.lock

@@ -42,4 +42,5 @@ members = [
     "open_the_lock",
     "maximum_performance_of_a_team",
     "longest_consecutive_sequence",
+    "min_cost_climbing_stairs",
 ]

Cargo.toml

@@ -1,7 +1,30 @@
 pub struct Solution {}
 
 impl Solution {
-    pub fn longest_consecutive(nums: Vec<i32>) -> i32 {}
+    pub fn longest_consecutive(nums: Vec<i32>) -> i32 {
+        if nums.len() == 0 {
+            return 0;
+        }
+
+        let mut numbers = nums.clone();
+        numbers.sort();
+        numbers.dedup();
+
+        let mut max_length = 0;
+        let mut temp_length = 1;
+        for n in numbers.windows(2) {
+            let j = n[1];
+            let i = n[0];
+            if j == i + 1 {
+                temp_length += 1;
+                continue;
+            }
+            max_length = max_length.max(temp_length);
+            temp_length = 1;
+        }
+        max_length = max_length.max(temp_length);
+        max_length
+    }
 }
 
 #[cfg(test)]
@@ -15,6 +38,7 @@ mod tests {
         assert_eq!(Solution::longest_consecutive(nums.to_vec()), expected);
     }
 
+    #[test]
     fn example_2() {
         let nums = [0, 3, 7, 2, 5, 8, 4, 6, 0, 1];
         let expected = 9;

longest_consecutive_sequence/src/lib.rs

@@ -0,0 +1,9 @@
+[package]
+name = "min_cost_climbing_stairs"
+version = "0.1.0"
+authors = ["Ryan Li <conbas2019@gmail.com>"]
+edition = "2018"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]

min_cost_climbing_stairs/Cargo.toml

@@ -0,0 +1,7 @@
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn it_works() {
+        assert_eq!(2 + 2, 4);
+    }
+}