Package g1801_1900.s1879_minimum_xor_sum_of_two_arrays

Class Solution

java.lang.Object

g1801_1900.s1879_minimum_xor_sum_of_two_arrays.Solution

public class Solution
extends Object

1879 - Minimum XOR Sum of Two Arrays\. Hard You are given two integer arrays `nums1` and `nums2` of length `n`. The **XOR sum** of the two integer arrays is `(nums1[0] XOR nums2[0]) + (nums1[1] XOR nums2[1]) + ... + (nums1[n - 1] XOR nums2[n - 1])` ( **0-indexed** ). * For example, the **XOR sum** of `[1,2,3]` and `[3,2,1]` is equal to `(1 XOR 3) + (2 XOR 2) + (3 XOR 1) = 2 + 0 + 2 = 4`. Rearrange the elements of `nums2` such that the resulting **XOR sum** is **minimized**. Return _the **XOR sum** after the rearrangement_. **Example 1:** **Input:** nums1 = [1,2], nums2 = [2,3] **Output:** 2 **Explanation:** Rearrange `nums2` so that it becomes `[3,2]`. The XOR sum is (1 XOR 3) + (2 XOR 2) = 2 + 0 = 2. **Example 2:** **Input:** nums1 = [1,0,3], nums2 = [5,3,4] **Output:** 8 **Explanation:** Rearrange `nums2` so that it becomes `[5,4,3]`. The XOR sum is (1 XOR 5) + (0 XOR 4) + (3 XOR 3) = 4 + 4 + 0 = 8. **Constraints:** * `n == nums1.length` * `n == nums2.length` * `1 <= n <= 14` * 0 <= nums1[i], nums2[i] <= 107

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	minimumXORSum(int[] nums1, int[] nums2)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

minimumXORSum

public int minimumXORSum(int[] nums1,
 int[] nums2)