modify on class

src/class04_06/Code01_Comparator.java

@@ -3,9 +3,7 @@ package class04_06;
 import java.util.ArrayList;
 import java.util.Arrays;
 import java.util.Comparator;
-import java.util.PriorityQueue;
 import java.util.TreeMap;
-import java.util.TreeSet;
 
 public class Code01_Comparator {
 

src/class04_07/Code01_CoverMax.java

@@ -32,8 +32,7 @@ public class Code01_CoverMax {
 			lines[i] = new Line(m[i][0], m[i][1]);
 		}
 		Arrays.sort(lines, new StartComparator());
-		// lines   
+		// 小根堆，每一条线段的结尾数值，使用默认的
-		// 
 		PriorityQueue<Integer> heap = new PriorityQueue<>();
 		int max = 0;
 		for (int i = 0; i < lines.length; i++) {

src/class04_07/Code02_EveryStepShowBoss.java

@@ -8,12 +8,12 @@ import java.util.List;
 public class Code02_EveryStepShowBoss {
 
 	public static class Customer {
-		public int value;
+		public int id;
 		public int buy;
 		public int enterTime;
 
 		public Customer(int v, int b, int o) {
-			value = v;
+			id = v;
 			buy = b;
 			enterTime = 0;
 		}
@@ -50,21 +50,22 @@ public class Code02_EveryStepShowBoss {
 			daddyLimit = limit;
 		}
 
-		public void operate(int time, int number, boolean buyOrRefund) {
+		// 当前处理i号事件，arr[i] -> id,  buyOrRefund
-			if (!buyOrRefund && !customers.containsKey(number)) {
+		public void operate(int time, int id, boolean buyOrRefund) {
+			if (!buyOrRefund && !customers.containsKey(id)) {
 				return;
 			}
-			if (!customers.containsKey(number)) {
+			if (!customers.containsKey(id)) {
-				customers.put(number, new Customer(number, 0, 0));
+				customers.put(id, new Customer(id, 0, 0));
 			}
-			Customer c = customers.get(number);
+			Customer c = customers.get(id);
 			if (buyOrRefund) {
 				c.buy++;
 			} else {
 				c.buy--;
 			}
 			if (c.buy == 0) {
-				customers.remove(number);
+				customers.remove(id);
 			}
 			if (!candHeap.contains(c) && !daddyHeap.contains(c)) {
 				if (daddyHeap.size() < daddyLimit) {
@@ -94,7 +95,7 @@ public class Code02_EveryStepShowBoss {
 			List<Customer> customers = daddyHeap.getAllElements();
 			List<Integer> ans = new ArrayList<>();
 			for (Customer c : customers) {
-				ans.add(c.value);
+				ans.add(c.id);
 			}
 			return ans;
 		}
@@ -131,30 +132,38 @@ public class Code02_EveryStepShowBoss {
 		return ans;
 	}
 
+	// 干完所有的事，模拟，不优化
 	public static List<List<Integer>> compare(int[] arr, boolean[] op, int k) {
 		HashMap<Integer, Customer> map = new HashMap<>();
 		ArrayList<Customer> cands = new ArrayList<>();
 		ArrayList<Customer> daddy = new ArrayList<>();
 		List<List<Integer>> ans = new ArrayList<>();
 		for (int i = 0; i < arr.length; i++) {
-			int num = arr[i];
+			int id = arr[i];
 			boolean buyOrRefund = op[i];
-			if (!buyOrRefund && !map.containsKey(num)) {
+			if (!buyOrRefund && !map.containsKey(id)) {
 				ans.add(getCurAns(daddy));
 				continue;
 			}
-			if (!map.containsKey(num)) {
+			// 没有发生：用户购买数为0并且又退货了
-				map.put(num, new Customer(num, 0, 0));
+			// 用户之前购买数是0，此时买货事件
+			// 用户之前购买数>0， 此时买货
+			// 用户之前购买数>0, 此时退货
+			if (!map.containsKey(id)) {
+				map.put(id, new Customer(id, 0, 0));
 			}
-			Customer c = map.get(num);
+			// 买、卖
+			Customer c = map.get(id);
 			if (buyOrRefund) {
 				c.buy++;
 			} else {
 				c.buy--;
 			}
 			if (c.buy == 0) {
-				map.remove(num);
+				map.remove(id);
 			}
+			// c
+			// 下面做
 			if (!cands.contains(c) && !daddy.contains(c)) {
 				if (daddy.size() < k) {
 					c.enterTime = i;
@@ -171,7 +180,6 @@ public class Code02_EveryStepShowBoss {
 			move(cands, daddy, k, i);
 			ans.add(getCurAns(daddy));
 		}
-
 		return ans;
 	}
 
@@ -179,12 +187,13 @@ public class Code02_EveryStepShowBoss {
 		if (cands.isEmpty()) {
 			return;
 		}
+		// 候选区不为空
 		if (daddy.size() < k) {
 			Customer c = cands.get(0);
 			c.enterTime = time;
 			daddy.add(c);
 			cands.remove(0);
-		} else {
+		} else { // 等奖区满了，候选区有东西
 			if (cands.get(0).buy > daddy.get(0).buy) {
 				Customer oldDaddy = daddy.get(0);
 				daddy.remove(0);
@@ -214,7 +223,7 @@ public class Code02_EveryStepShowBoss {
 	public static List<Integer> getCurAns(ArrayList<Customer> daddy) {
 		List<Integer> ans = new ArrayList<>();
 		for (Customer c : daddy) {
-			ans.add(c.value);
+			ans.add(c.id);
 		}
 		return ans;
 	}

src/class04_07/HeapGreater.java

@@ -5,6 +5,9 @@ import java.util.Comparator;
 import java.util.HashMap;
 import java.util.List;
 
+/*
+ * T一定要是非基础类型，有基础类型需求包一层
+ */
 public class HeapGreater<T> {
 
 	private ArrayList<T> heap;
@@ -67,6 +70,7 @@ public class HeapGreater<T> {
 		heapify(indexMap.get(obj));
 	}
 
+	// 请返回堆上的所有元素
 	public List<T> getAllElements() {
 		List<T> ans = new ArrayList<>();
 		for (T c : heap) {

src/class04_07/Inner.java

@@ -0,0 +1,9 @@
+package class04_07;
+
+public class Inner<T> {
+	public T value;
+
+	public Inner(T v) {
+		value = v;
+	}
+}