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

面试题56 - II. 数组中数字出现的次数 II

Author: YangFong

lcof/面试题56 - II. 数组中数字出现的次数 II/README.md

@@ -92,6 +92,27 @@ var singleNumber = function (nums) {
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn single_number(nums: Vec<i32>) -> i32 {
+        let mut counts = [0; 32];
+        for num in nums.iter() {
+            for i in 0..32 {
+                counts[i] += (num >> i) & 1;
+            }
+        }
+        let mut res = 0;
+        for count in counts.iter().rev() {
+            res <<= 1;
+            res |= count % 3;
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

lcof/面试题56 - II. 数组中数字出现的次数 II/Solution.rs

@@ -0,0 +1,16 @@
+impl Solution {
+    pub fn single_number(nums: Vec<i32>) -> i32 {
+        let mut counts = [0; 32];
+        for num in nums.iter() {
+            for i in 0..32 {
+                counts[i] += (num >> i) & 1;
+            }
+        }
+        let mut res = 0;
+        for count in counts.iter().rev() {
+            res <<= 1;
+            res |= count % 3;
+        }
+        res
+    }
+}