Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Commit 73d782b

Browse filesBrowse files
committed
auto commit
1 parent c2eb942 commit 73d782b
Copy full SHA for 73d782b

File tree

Expand file treeCollapse file tree

2 files changed

+3
-3
lines changed
Filter options
Expand file treeCollapse file tree

2 files changed

+3
-3
lines changed

‎notes/Java 虚拟机.md

Copy file name to clipboardExpand all lines: notes/Java 虚拟机.md
+1-1Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -169,7 +169,7 @@ finalize() 类似 C++ 的析构函数,用来做关闭外部资源等工作。
169169

170170
## 引用类型
171171

172-
无论是通过引用计算算法判断对象的引用数量,还是通过可达性分析算法判断对象是否可达,判定对象是否可被回收都与引用有关。
172+
无论是通过引用计数算法判断对象的引用数量,还是通过可达性分析算法判断对象是否可达,判定对象是否可被回收都与引用有关。
173173

174174
Java 提供了四种强度不同的引用类型。
175175

‎notes/剑指 offer 题解.md

Copy file name to clipboardExpand all lines: notes/剑指 offer 题解.md
+2-2Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -2690,8 +2690,8 @@ public ArrayList<Integer> maxInWindows(int[] num, int size) {
26902690
for (int i = 0; i < size; i++)
26912691
heap.add(num[i]);
26922692
ret.add(heap.peek());
2693-
for (int i = 1, j = i + size - 1; j < num.length; i++, j++) { /* 维护一个大小为 size 的大顶堆 */
2694-
heap.remove(num[i - 1]);
2693+
for (int i = 0, j = i + size; j < num.length; i++, j++) { /* 维护一个大小为 size 的大顶堆 */
2694+
heap.remove(num[i]);
26952695
heap.add(num[j]);
26962696
ret.add(heap.peek());
26972697
}

0 commit comments

Comments
0 (0)
Morty Proxy This is a proxified and sanitized view of the page, visit original site.