Sloved 0066

Author: guangsheng.li01

src/a0066_plus_one.rs

@@ -0,0 +1,44 @@
+/*
+ * [0066] plus-one
+ */
+
+pub struct Solution {}
+
+// solution impl starts here
+
+impl Solution {
+    pub fn plus_one(digits: Vec<i32>) -> Vec<i32> {
+        let mut digits = digits;
+        for i in (0..digits.len()).rev() {
+            digits[i] += 1;
+            digits[i] %= 10;
+            if digits[i] != 0 {
+                return digits;
+            }
+        }
+        let mut res = vec![1];
+        res.append(&mut digits);
+        res
+    }
+}
+
+// solution impl ends here
+
+// solution tests starts here
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_case0() {
+        assert_eq!(Solution::plus_one(vec![1, 2, 3]), vec![1, 2, 4]);
+    }
+
+    #[test]
+    fn test_case1() {
+        assert_eq!(Solution::plus_one(vec![9, 9, 9]), vec![1, 0, 0, 0]);
+    }
+}
+
+// solution tests ends here

src/lib.rs

@@ -11,6 +11,7 @@ mod a0026_remove_duplicates_from_sorted_array;
 mod a0027_remove_element;
 mod a0035_search_insert_position;
 mod a0053_maximum_subarray;
+mod a0066_plus_one;
 mod a0145_binary_tree_postorder_traversal;
 mod a0172_factorial_trailing_zeroes;
 mod a0400_nth_digit;