|
| 1 | +package weekly; |
| 2 | + |
| 3 | +import java.util.ArrayList; |
| 4 | +import java.util.Arrays; |
| 5 | +import java.util.Collections; |
| 6 | +import java.util.HashMap; |
| 7 | +import java.util.HashSet; |
| 8 | +import java.util.List; |
| 9 | +import java.util.Map; |
| 10 | +import java.util.PriorityQueue; |
| 11 | +import java.util.Set; |
| 12 | + |
| 13 | +public class wkb122 { |
| 14 | + |
| 15 | + public int minimumCost(int[] nums) { |
| 16 | + PriorityQueue<Integer> priorityQueue = new PriorityQueue<>(); |
| 17 | + for (int i = 1; i < nums.length; i++) { |
| 18 | + priorityQueue.add(nums[i]); |
| 19 | + } |
| 20 | + int ans = nums[0]; |
| 21 | + for (int i = 0; i < 2; i++) { |
| 22 | + ans += priorityQueue.poll(); |
| 23 | + } |
| 24 | + return ans; |
| 25 | + } |
| 26 | + |
| 27 | + // public boolean canSortArray(int[] nums) { |
| 28 | +// List<List<Integer>> counter = new ArrayList<>(); |
| 29 | +// List<List<Integer>> indexes = new ArrayList<>(); |
| 30 | +// for (int i = 0; i <= 8; i++) { |
| 31 | +// counter.add(new ArrayList<>()); |
| 32 | +// indexes.add(new ArrayList<>()); |
| 33 | +// } |
| 34 | +// for (int i = 0; i < nums.length; i++) { |
| 35 | +// int c = Integer.bitCount(nums[i]); |
| 36 | +// counter.get(c).add(i); |
| 37 | +// indexes.get(c).add(i); |
| 38 | +// } |
| 39 | +// for (List<Integer> list : counter) { |
| 40 | +// Collections.sort(list, (a, b) -> nums[a] - nums[b]); |
| 41 | +// } |
| 42 | +// int[] temp = new int[nums.length]; |
| 43 | +// for (int i = 0; i <= 8; i++) { |
| 44 | +// for (int j = 0; j < counter.get(i).size(); j++) { |
| 45 | +// temp[indexes.get(i).get(j)]=nums[counter.get(i).get(j)]; |
| 46 | +// } |
| 47 | +// } |
| 48 | +// for (int i = 1; i < temp.length; i++) { |
| 49 | +// if(temp[i]<temp[i-1])return false; |
| 50 | +// } |
| 51 | +// return true; |
| 52 | +// } |
| 53 | + |
| 54 | + |
| 55 | + //分组循环 |
| 56 | + public boolean canSortArray(int[] nums) { |
| 57 | + int preMax = 0; |
| 58 | + |
| 59 | + int i = 0; |
| 60 | + while (i < nums.length) { |
| 61 | + int max=nums[i]; |
| 62 | + int ones=Integer.bitCount(nums[i]); |
| 63 | + while (i<nums.length&&ones==Integer.bitCount(nums[i])){ |
| 64 | + if(nums[i]<preMax){ |
| 65 | + return false; |
| 66 | + } |
| 67 | + max=Math.max(max,nums[i]); |
| 68 | + } |
| 69 | + preMax=max; |
| 70 | + } |
| 71 | + |
| 72 | + return true; |
| 73 | + } |
| 74 | + |
| 75 | +// public int minimumArrayLength(int[] nums) { |
| 76 | +// Map<Integer, Integer> counter = new HashMap<>(); |
| 77 | +// int min = nums[0]; |
| 78 | +// for (int num : nums) { |
| 79 | +// counter.put(num, counter.getOrDefault(num, 0) + 1); |
| 80 | +// min = Math.min(min, num); |
| 81 | +// } |
| 82 | +// int c = counter.get(min); |
| 83 | +// return (c+1)/2; |
| 84 | +// } |
| 85 | + |
| 86 | + //贪心 |
| 87 | + public int minimumArrayLength(int[] nums) { |
| 88 | + Map<Integer, Integer> counter = new HashMap<>(); |
| 89 | + for (int num : nums) { |
| 90 | + counter.put(num, counter.getOrDefault(num, 0) + 1); |
| 91 | + } |
| 92 | + Arrays.sort(nums); |
| 93 | + int min = nums[0]; |
| 94 | + int ans = -1; |
| 95 | + |
| 96 | + //能不能构造出小于min的整数 |
| 97 | + boolean canFind = false; |
| 98 | + for (int i = 0; i < nums.length; i++) { |
| 99 | + if (nums[i] % min != 0) { |
| 100 | + canFind = true; |
| 101 | + } |
| 102 | + } |
| 103 | + |
| 104 | + if (canFind) { |
| 105 | + return 1; |
| 106 | + } else { |
| 107 | + return (counter.get(min) + 1) / 2; |
| 108 | + } |
| 109 | + } |
| 110 | + |
| 111 | + |
| 112 | + // 滑动窗口中的前 k 小值 |
| 113 | + // 滑动窗口+双堆+懒删除 |
| 114 | + // 或 treeMap |
| 115 | + public long minimumCost(int[] nums, int k, int dist) { |
| 116 | + long ans = Long.MAX_VALUE; |
| 117 | + long sum = 0; |
| 118 | + |
| 119 | + //记录堆里有哪些还没被删除 |
| 120 | + Set<Integer> leftSet = new HashSet<>(); |
| 121 | + Set<Integer> rightSet = new HashSet<>(); |
| 122 | + //大跟堆 |
| 123 | + PriorityQueue<Integer> leftPq = new PriorityQueue<>((a, b) -> nums[b] - nums[a]); |
| 124 | + //小跟堆 |
| 125 | + PriorityQueue<Integer> rightPq = new PriorityQueue<>((a, b) -> nums[a] - nums[b]); |
| 126 | + for (int i = 1; i < Math.min(1 + dist, nums.length); i++) { |
| 127 | + //左堆添加 |
| 128 | + leftSet.add(i); |
| 129 | + leftPq.add(i); |
| 130 | + sum += nums[i]; |
| 131 | + if (leftPq.size() > k - 1) { |
| 132 | + |
| 133 | + //左堆删除 |
| 134 | + Integer poll = leftPq.poll(); |
| 135 | + leftSet.remove(poll); |
| 136 | + sum -= nums[poll]; |
| 137 | + |
| 138 | + //右堆添加 |
| 139 | + rightPq.add(poll); |
| 140 | + rightSet.add(poll); |
| 141 | + } |
| 142 | + } |
| 143 | + |
| 144 | + for (int begin = 1; begin + dist < nums.length; begin++) { |
| 145 | + int end = begin + dist; |
| 146 | + //左堆添加 |
| 147 | + leftPq.add(end); |
| 148 | + leftSet.add(end); |
| 149 | + sum += nums[end]; |
| 150 | + while (leftSet.size() > k - 1) { |
| 151 | + Integer poll = leftPq.poll(); |
| 152 | + //是不是之前已经被删除了 |
| 153 | + if (!leftSet.contains(poll)) continue; |
| 154 | + //左堆删除 |
| 155 | + leftSet.remove(poll); |
| 156 | + sum -= nums[poll]; |
| 157 | + |
| 158 | + //右堆添加 |
| 159 | + rightPq.add(poll); |
| 160 | + rightSet.add(poll); |
| 161 | + } |
| 162 | + |
| 163 | + // 结果判断 |
| 164 | + ans = Math.min(sum, ans); |
| 165 | + |
| 166 | + // 开始滑动窗口 |
| 167 | + //左堆是不是有这个 |
| 168 | + if (leftSet.contains(begin)) { |
| 169 | + //左堆删除，pq先不变 |
| 170 | + sum -= nums[begin]; |
| 171 | + leftSet.remove(begin); |
| 172 | + } |
| 173 | + // 右堆也可能删除 |
| 174 | + rightSet.remove(begin); |
| 175 | + |
| 176 | + // 左堆不足k-1个，用右堆来补齐 |
| 177 | + while (!rightSet.isEmpty() && leftSet.size() < k - 1) { |
| 178 | + //右堆删除 |
| 179 | + Integer poll = rightPq.poll(); |
| 180 | + if (!rightSet.contains(poll)) continue; |
| 181 | + //左堆添加 |
| 182 | + leftPq.add(poll); |
| 183 | + leftSet.add(poll); |
| 184 | + sum += nums[poll]; |
| 185 | + } |
| 186 | + } |
| 187 | + return ans + nums[0]; |
| 188 | + } |
| 189 | + |
| 190 | + |
| 191 | + public static void main(String[] args) { |
| 192 | + wkb122 w = new wkb122(); |
| 193 | + w.minimumCost(new int[]{1, 3, 2, 6, 4, 2}, 3, 3); |
| 194 | + } |
| 195 | +} |
0 commit comments