leetcode 一道简单题的疑问# JobHunting - 待字闺中
v*p
1 楼
Write a function to delete a node (except the tail) in a singly linked list
, given only access to that node.
Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third
node with value 3, the linked list should become 1 -> 2 -> 4 after calling
your function.
题目不难， 答案是：
public void deleteNode(ListNode node) {
if(node == null || node.next == null) return;
node.val = node.next.val;
node.next = node.next.next;
}
可是不明白为什么下面的不对：
public void deleteNode(ListNode node) {
if(node == null || node.next == null) return;
node = node.next;
}
, given only access to that node.
Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third
node with value 3, the linked list should become 1 -> 2 -> 4 after calling
your function.
题目不难， 答案是：
public void deleteNode(ListNode node) {
if(node == null || node.next == null) return;
node.val = node.next.val;
node.next = node.next.next;
}
可是不明白为什么下面的不对：
public void deleteNode(ListNode node) {
if(node == null || node.next == null) return;
node = node.next;
}
