huangge1199/leet-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

1787:使所有区间的异或结果为零

Browse Source
This commit is contained in:
huangge1199 2021-05-26 09:35:28 +08:00
parent 5eac3e114f
commit 18042526c9
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
src/main/java/leetcode/editor/cn/MakeTheXorOfAllSegmentsEqualToZero.java
View File

@ -65,6 +65,7 @@ public class MakeTheXorOfAllSegmentsEqualToZero {
//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
public int minChanges(int[] nums, int k) {
int numCount = 1 << 10;
List<Map<Integer, Integer>> list = new ArrayList<>();
for (int i = 0; i < k; i++) {
list.add(new HashMap<>());
@ -75,16 +76,16 @@ public class MakeTheXorOfAllSegmentsEqualToZero {
map.put(nums[i], map.getOrDefault(nums[i], 0) + 1);
list.set(index, map);
}
int[] flag = new int[1 << 10];
int[] flag = new int[numCount];
Arrays.fill(flag, Integer.MAX_VALUE / 2);
flag[0] = 0;
int length = nums.length % k == 0 ? nums.length / k : nums.length / k + 1;
for (int i = 0; i < k; i++) {
Map<Integer, Integer> map = list.get(i);
int min = Arrays.stream(flag).min().getAsInt();
int[] temp = new int[1 << 10];
int[] temp = new int[numCount];
Arrays.fill(temp, min);
for (int j = 0; j < (1 << 10); j++) {
for (int j = 0; j < numCount; j++) {
for (int key : map.keySet()) {
temp[j] = Math.min(temp[j], flag[j ^ key] - map.get(key));
}