algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-14 06:55:41 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0707.设计链表.md

Browse Source
This commit is contained in:
程序员Carl
2022-07-07 09:00:14 +08:00
committed by GitHub
parent d0814a723c
commit 0c6b1db35c
1 changed files with 1 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
problems/0707.设计链表.md
View File

@ -106,12 +106,9 @@ public:
// 如果index大于链表的长度，则返回空 // 如果index大于链表的长度，则返回空
// 如果index小于0，则置为0，作为链表的新头节点。 // 如果index小于0，则置为0，作为链表的新头节点。
void addAtIndex(int index, int val) { void addAtIndex(int index, int val) {
if (index > _size) { if (index > _size || index < 0) {
return; return;
} }
else if (index < 0) {
index = 0;
}
LinkedNode* newNode = new LinkedNode(val); LinkedNode* newNode = new LinkedNode(val);
LinkedNode* cur = _dummyHead; LinkedNode* cur = _dummyHead;
while(index--) { while(index--) {