feat: add rust solution to lc problem: No.0540

No.0540.Single Element in a Sorted Array

Author: YangFong

solution/0500-0599/0540.Single Element in a Sorted Array/README.md

@@ -125,6 +125,26 @@ func singleNonDuplicate(nums []int) int {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn single_non_duplicate(nums: Vec<i32>) -> i32 {
+        let mut l = 0;
+        let mut r = nums.len() - 1;
+        while l < r {
+            let mid = l + r >> 1;
+            if nums[mid] == nums[mid ^ 1] {
+                l = mid + 1;
+            } else {
+                r = mid;
+            }
+        }
+        nums[l]
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0500-0599/0540.Single Element in a Sorted Array/README_EN.md

@@ -128,6 +128,26 @@ func singleNonDuplicate(nums []int) int {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn single_non_duplicate(nums: Vec<i32>) -> i32 {
+        let mut l = 0;
+        let mut r = nums.len() - 1;
+        while l < r {
+            let mid = l + r >> 1;
+            if nums[mid] == nums[mid ^ 1] {
+                l = mid + 1;
+            } else {
+                r = mid;
+            }
+        }
+        nums[l]
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0500-0599/0540.Single Element in a Sorted Array/Solution.rs

@@ -0,0 +1,15 @@
+impl Solution {
+    pub fn single_non_duplicate(nums: Vec<i32>) -> i32 {
+        let mut l = 0;
+        let mut r = nums.len() - 1;
+        while l < r {
+            let mid = l + r >> 1;
+            if nums[mid] == nums[mid ^ 1] {
+                l = mid + 1;
+            } else {
+                r = mid;
+            }
+        }
+        nums[l]
+    }
+}