[feat] 2025-2-25 daily test

Author: Ijiamuyu

lcof2/剑指 Offer II 004. 只出现一次的数字/Solution.cpp

@@ -1,3 +1,7 @@
+#include <iostream>
+#include <vector>
+using namespace std;
+
 class Solution {
 public:
     int singleNumber(vector<int>& nums) {
@@ -18,24 +22,30 @@ class Solution {
 public:
     int singleNumber(vector<int>& nums) {
         vector<int> array(32);
+        array.assign(array.size(), 0);
         int ret = 0;
-        for(int i = 0; i < nums.size(); i++)
-        {
-            for(int j = 0; j < 32; j++)
-            {
-                if(nums[i] & (1 << j))
-                {
-                    array[j]++;
-                }
-            }
-        }
         for(int i = 0; i < 32; i++)
         {
-            if(array[i] % 3)
+            for(int j = 0; j < nums.size(); j++)
             {
-                ret += ((array[i] % 3) << i);
+                array[i] += (nums[j] >> i) & 1;
             }
+            array[i] %= 3;
+            ret |= array[i] << i;
         }
         return ret;
     }
-}; 
+};
+
+int main()
+{
+    Solution solution;
+    int a[4] = {2,2,3,2};
+    vector<int> b;
+    b.insert(b.begin(),a,a+4);
+    int result = solution.singleNumber(b);
+    cout << "Result of  Solution  is: " << result << endl;
+
+    return 0;
+}
+