feat: add more

Author: gengjiawen

Cargo.lock

@@ -9,5 +9,6 @@ members = [
     "greedy",
     "trie",
     "stack",
+    "Math",
     "priority_queue"
 ]

Cargo.toml

@@ -0,0 +1,10 @@
+[package]
+name = "leetcode_math"
+version = "0.1.0"
+edition = "2021"
+
+[lib]
+path = "lib.rs"
+doctest = false
+
+[dependencies]

Math/Cargo.toml

@@ -0,0 +1,61 @@
+// https://leetcode.com/problems/plus-one
+//
+// You are given a **large integer** represented as an integer array `digits`, where each `digits[i]` is the `i<sup>th</sup>` digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading `0`'s.
+//
+// Increment the large integer by one and return _the resulting array of digits_.
+//
+// **Example 1:**
+//
+// ```
+// **Input:** digits = [1,2,3]
+// **Output:** [1,2,4]
+// **Explanation:** The array represents the integer 123.
+// Incrementing by one gives 123 + 1 = 124.
+// Thus, the result should be [1,2,4].
+// ```
+//
+// **Example 2:**
+//
+// ```
+// **Input:** digits = [4,3,2,1]
+// **Output:** [4,3,2,2]
+// **Explanation:** The array represents the integer 4321.
+// Incrementing by one gives 4321 + 1 = 4322.
+// Thus, the result should be [4,3,2,2].
+// ```
+//
+// **Example 3:**
+//
+// ```
+// **Input:** digits = [9]
+// **Output:** [1,0]
+// **Explanation:** The array represents the integer 9.
+// Incrementing by one gives 9 + 1 = 10.
+// Thus, the result should be [1,0].
+// ```
+//
+// **Constraints:**
+//
+// *   `1 <= digits.length <= 100`
+// *   `0 <= digits[i] <= 9`
+// *   `digits` does not contain any leading `0`'s.
+
+pub fn plus_one(digits: Vec<i32>) -> Vec<i32> {
+    let mut digits_clone = digits.clone();
+    for x in digits_clone.iter_mut().rev() {
+        if *x < 9 {
+            *x += 1;
+            return digits_clone;
+        } else {
+            *x = 0;
+        }
+    }
+    digits_clone.insert(0, 1);
+    return digits_clone;
+}
+
+#[test]
+pub fn t1() {
+    assert_eq!(plus_one(vec![1, 2, 3]), vec![1, 2, 4]);
+    assert_eq!(plus_one(vec![9, 9]), vec![1, 0, 0]);
+}

Math/_0066_plus_one.rs

@@ -0,0 +1,3 @@
+#![allow(dead_code)]
+
+mod _0066_plus_one;