mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-07 15:45:40 +08:00
@ -585,7 +585,7 @@ impl Solution {
|
|||||||
let mut dummyHead = Box::new(ListNode::new(0));
|
let mut dummyHead = Box::new(ListNode::new(0));
|
||||||
dummyHead.next = head;
|
dummyHead.next = head;
|
||||||
let mut cur = dummyHead.as_mut();
|
let mut cur = dummyHead.as_mut();
|
||||||
// 使用take()替换std::men::replace(&mut node.next, None)达到相同的效果,并且更普遍易读
|
// 使用take()替换std::mem::replace(&mut node.next, None)达到相同的效果,并且更普遍易读
|
||||||
while let Some(nxt) = cur.next.take() {
|
while let Some(nxt) = cur.next.take() {
|
||||||
if nxt.val == val {
|
if nxt.val == val {
|
||||||
cur.next = nxt.next;
|
cur.next = nxt.next;
|
||||||
|
Reference in New Issue
Block a user