javamickey
diff --git a/‎docs/notes/Leetcode 题解.md‎
Lines changed: 4 additions & 6 deletions b/‎docs/notes/Leetcode 题解.md‎
Lines changed: 4 additions & 6 deletions
diff --git a/‎docs/notes/pics/cb5d2258-a60e-4364-94a7-3429a3064554_200.png‎
37 KB b/‎docs/notes/pics/cb5d2258-a60e-4364-94a7-3429a3064554_200.png‎
37 KB
diff --git a/‎docs/notes/算法.md‎
Lines changed: 1 addition & 1 deletion b/‎docs/notes/算法.md‎
Lines changed: 1 addition & 1 deletion
diff --git a/‎docs/pics/cb5d2258-a60e-4364-94a7-3429a3064554_200.png‎
37 KB b/‎docs/pics/cb5d2258-a60e-4364-94a7-3429a3064554_200.png‎
37 KB
@@ -403,12 +403,10 @@ public List<Integer> topKFrequent(int[] nums, int k) {
     }
     List<Integer> topK = new ArrayList<>();
     for (int i = buckets.length - 1; i >= 0 && topK.size() < k; i--) {
-        if (buckets[i] != null) {
-            if (buckets[i].size() <= (k - topK.size())) {
-                topK.addAll(buckets[i]);
-            } else {
-                topK.addAll(buckets[i].subList(0, k - topK.size()));
-            }
+        if (buckets[i].size() <= (k - topK.size())) {
+            topK.addAll(buckets[i]);
+        } else {
+            topK.addAll(buckets[i].subList(0, k - topK.size()));
         }
     }
     return topK;
 
@@ -382,7 +382,7 @@ public class Insertion<T extends Comparable<T>> extends Sort<T> {
 
 希尔排序使用插入排序对间隔 h 的序列进行排序。通过不断减小 h，最后令 h=1，就可以使得整个数组是有序的。
 
-<div align="center"> <img src="pics/1_200.png"/> </div><br>
+<div align="center"> <img src="pics/cb5d2258-a60e-4364-94a7-3429a3064554_200.png"/> </div><br>
 
 ```java
 public class Shell<T extends Comparable<T>> extends Sort<T> {
Original file line number	Diff line number	Diff line change
`@@ -403,12 +403,10 @@ public List<Integer> topKFrequent(int[] nums, int k) {`
`403`	`403`	`}`
`404`	`404`	`List<Integer> topK = new ArrayList<>();`
`405`	`405`	`for (int i = buckets.length - 1; i >= 0 && topK.size() < k; i--) {`
`406`		`- if (buckets[i] != null) {`
`407`		`- if (buckets[i].size() <= (k - topK.size())) {`
`408`		`- topK.addAll(buckets[i]);`
`409`		`- } else {`
`410`		`- topK.addAll(buckets[i].subList(0, k - topK.size()));`
`411`		`- }`
	`406`	`+ if (buckets[i].size() <= (k - topK.size())) {`
	`407`	`+ topK.addAll(buckets[i]);`
	`408`	`+ } else {`
	`409`	`+ topK.addAll(buckets[i].subList(0, k - topK.size()));`
`412`	`410`	`}`
`413`	`411`	`}`
`414`	`412`	`return topK;`