StarMirror/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

fix(算法): 符号表——二分查找实现有序符号表中插入新节点考虑容量问题

Browse Source
This commit is contained in:
Mingyue Li 2021-11-16 10:20:49 +08:00 committed by GitHub
parent 456ff183d5
commit ec84f5b3ef
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
notes/算法 - 符号表.md
View File

@ -213,6 +213,8 @@ public class BinarySearchOrderedST<Key extends Comparable<Key>, Value> implement
values[index] = value; values[index] = value;
return; return;
} }
// 如果插入后容量大于初始化容量，则放弃当前操作（或者其他实现）。
if (N >= keys.length) return;
// 否则在数组中插入新的节点，需要先将插入位置之后的元素都向后移动一个位置 // 否则在数组中插入新的节点，需要先将插入位置之后的元素都向后移动一个位置
for (int j = N; j > index; j--) { for (int j = N; j > index; j--) {
keys[j] = keys[j - 1]; keys[j] = keys[j - 1];