feat: add rust solution to lcof problem: No.53 - |

面试题 53 - I. 在排序数组中查找数字 I

Author: YangFong

lcof/面试题53 - I. 在排序数组中查找数字 I/README.md

@@ -200,6 +200,48 @@ var search = function (nums, target) {
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn search(nums: Vec<i32>, target: i32) -> i32 {
+        fn my_search(nums: &Vec<i32>, target: i32, left: i32, right: i32) -> i32 {
+            if left > right {
+                return 0;
+            }
+
+            let index = (right - left) / 2 + left;
+            let num = nums[index as usize];
+            if num > target {
+                my_search(nums, target, left, index - 1)
+            } else if num < target {
+                my_search(nums, target, index + 1, right)
+            } else {
+                // 搜索边界
+                let mut count = 1;
+                for i in (0..index).rev() {
+                    if nums[i as usize] == target {
+                        count += 1;
+                    } else {
+                        break;
+                    }
+                }
+                for i in (index + 1)..nums.len() as i32  {
+                    if nums[i as usize] == target {
+                        count += 1;
+                    } else {
+                        break;
+                    }
+                }
+                count
+            }
+        }
+
+        my_search(&nums, target, 0, nums.len() as i32 - 1)
+    }
+}
+```
+
 ### **...**
 
 ```

lcof/面试题53 - I. 在排序数组中查找数字 I/Solution.rs

@@ -0,0 +1,37 @@
+impl Solution {
+    pub fn search(nums: Vec<i32>, target: i32) -> i32 {
+        fn my_search(nums: &Vec<i32>, target: i32, left: i32, right: i32) -> i32 {
+            if left > right {
+                return 0;
+            }
+
+            let index = (right - left) / 2 + left;
+            let num = nums[index as usize];
+            if num > target {
+                my_search(nums, target, left, index - 1)
+            } else if num < target {
+                my_search(nums, target, index + 1, right)
+            } else {
+                // 搜索边界
+                let mut count = 1;
+                for i in (0..index).rev() {
+                    if nums[i as usize] == target {
+                        count += 1;
+                    } else {
+                        break;
+                    }
+                }
+                for i in (index + 1)..nums.len() as i32 {
+                    if nums[i as usize] == target {
+                        count += 1;
+                    } else {
+                        break;
+                    }
+                }
+                count
+            }
+        }
+
+        my_search(&nums, target, 0, nums.len() as i32 - 1)
+    }
+}