feat: add solutions to lc problem: No.1835

No.1835.Find XOR Sum of All Pairs Bitwise AND

Author: yanglbme

solution/1800-1899/1835.Find XOR Sum of All Pairs Bitwise AND/README.md

@@ -47,22 +47,88 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：位运算**
+
+假设数组 `arr1` 的元素分别为 $a_1, a_2, \cdots, a_n$，数组 `arr2` 的元素分别为 $b_1, b_2, \cdots, b_m$，那么题目答案为：
+
+$$
+\begin{aligned}
+\text{ans} &= (a_1 \wedge b_1) \oplus (a_1 \wedge b_2) ... (a_1 \wedge b_m) \\
+&\quad \oplus (a_2 \wedge b_1) \oplus (a_2 \wedge b_2) ... (a_2 \wedge b_m) \\
+&\quad \oplus \cdots \\
+&\quad \oplus (a_n \wedge b_1) \oplus (a_n \wedge b_2) ... (a_n \wedge b_m) \\
+\end{aligned}
+$$
+
+由于布尔代数中，异或运算就是不进位的加法，与运算就是乘法，所以上式可以简化为：
+
+$$
+\text{ans} = (a_1 \oplus a_2 \oplus \cdots \oplus a_n) \wedge (b_1 \oplus b_2 \oplus \cdots \oplus b_m)
+$$
+
+即，数组 `arr1` 的异或和与数组 `arr2` 的异或和的与运算结果。
+
+时间复杂度 $O(n + m)$，空间复杂度 $O(1)$。其中 $n$ 和 $m$ 分别为数组 `arr1` 和 `arr2` 的长度。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def getXORSum(self, arr1: List[int], arr2: List[int]) -> int:
+        a = reduce(xor, arr1)
+        b = reduce(xor, arr2)
+        return a & b
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int getXORSum(int[] arr1, int[] arr2) {
+        int a = 0, b = 0;
+        for (int v : arr1) {
+            a ^= v;
+        }
+        for (int v : arr2) {
+            b ^= v;
+        }
+        return a & b;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int getXORSum(vector<int>& arr1, vector<int>& arr2) {
+        int a = accumulate(arr1.begin(), arr1.end(), 0, bit_xor<int>());
+        int b = accumulate(arr2.begin(), arr2.end(), 0, bit_xor<int>());
+        return a & b;
+    }
+};
+```
 
+### **Go**
+
+```go
+func getXORSum(arr1 []int, arr2 []int) int {
+	var a, b int
+	for _, v := range arr1 {
+		a ^= v
+	}
+	for _, v := range arr2 {
+		b ^= v
+	}
+	return a & b
+}
 ```
 
 ### **...**

solution/1800-1899/1835.Find XOR Sum of All Pairs Bitwise AND/README_EN.md

@@ -49,13 +49,56 @@ The XOR sum = 0 XOR 1 XOR 2 XOR 0 XOR 2 XOR 1 = 0.
 ### **Python3**
 
 ```python
-
+class Solution:
+    def getXORSum(self, arr1: List[int], arr2: List[int]) -> int:
+        a = reduce(xor, arr1)
+        b = reduce(xor, arr2)
+        return a & b
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int getXORSum(int[] arr1, int[] arr2) {
+        int a = 0, b = 0;
+        for (int v : arr1) {
+            a ^= v;
+        }
+        for (int v : arr2) {
+            b ^= v;
+        }
+        return a & b;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int getXORSum(vector<int>& arr1, vector<int>& arr2) {
+        int a = accumulate(arr1.begin(), arr1.end(), 0, bit_xor<int>());
+        int b = accumulate(arr2.begin(), arr2.end(), 0, bit_xor<int>());
+        return a & b;
+    }
+};
+```
 
+### **Go**
+
+```go
+func getXORSum(arr1 []int, arr2 []int) int {
+	var a, b int
+	for _, v := range arr1 {
+		a ^= v
+	}
+	for _, v := range arr2 {
+		b ^= v
+	}
+	return a & b
+}
 ```
 
 ### **...**

solution/1800-1899/1835.Find XOR Sum of All Pairs Bitwise AND/Solution.cpp

@@ -0,0 +1,8 @@
+class Solution {
+public:
+    int getXORSum(vector<int>& arr1, vector<int>& arr2) {
+        int a = accumulate(arr1.begin(), arr1.end(), 0, bit_xor<int>());
+        int b = accumulate(arr2.begin(), arr2.end(), 0, bit_xor<int>());
+        return a & b;
+    }
+};

solution/1800-1899/1835.Find XOR Sum of All Pairs Bitwise AND/Solution.go

@@ -0,0 +1,10 @@
+func getXORSum(arr1 []int, arr2 []int) int {
+	var a, b int
+	for _, v := range arr1 {
+		a ^= v
+	}
+	for _, v := range arr2 {
+		b ^= v
+	}
+	return a & b
+}

solution/1800-1899/1835.Find XOR Sum of All Pairs Bitwise AND/Solution.java

@@ -0,0 +1,12 @@
+class Solution {
+    public int getXORSum(int[] arr1, int[] arr2) {
+        int a = 0, b = 0;
+        for (int v : arr1) {
+            a ^= v;
+        }
+        for (int v : arr2) {
+            b ^= v;
+        }
+        return a & b;
+    }
+}

solution/1800-1899/1835.Find XOR Sum of All Pairs Bitwise AND/Solution.py

@@ -0,0 +1,5 @@
+class Solution:
+    def getXORSum(self, arr1: List[int], arr2: List[int]) -> int:
+        a = reduce(xor, arr1)
+        b = reduce(xor, arr2)
+        return a & b