mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-11 21:10:58 +08:00
@ -50,10 +50,6 @@ public:
|
||||
cur = cur->next;
|
||||
count++;
|
||||
}
|
||||
if (vec.size() % 2 == 0) { // 如果是偶数,还要多处理中间的一个
|
||||
cur->next = vec[i];
|
||||
cur = cur->next;
|
||||
}
|
||||
cur->next = nullptr; // 注意结尾
|
||||
}
|
||||
};
|
||||
@ -249,12 +245,6 @@ public class ReorderList {
|
||||
cur = cur.next;
|
||||
count++;
|
||||
}
|
||||
// 当是偶数的话,需要做额外处理
|
||||
if (list.size() % 2== 0){
|
||||
cur.next = list.get(l);
|
||||
cur = cur.next;
|
||||
}
|
||||
|
||||
// 注意结尾要结束一波
|
||||
cur.next = null;
|
||||
}
|
||||
@ -376,11 +366,6 @@ var reorderList = function(head, s = [], tmp) {
|
||||
cur = cur.next;
|
||||
count++;
|
||||
}
|
||||
// 当是偶数的话,需要做额外处理
|
||||
if(list.length % 2 == 0){
|
||||
cur.next = list[l];
|
||||
cur = cur.next;
|
||||
}
|
||||
// 注意结尾要结束一波
|
||||
cur.next = null;
|
||||
}
|
||||
|
Reference in New Issue
Block a user