From : https://leetcode.com/problems/delete-node-in-a-linked-list/
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.
只删除一个结点。
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public void deleteNode(ListNode node) {
int v = 0;
if(null != node) {
v = node.val;
}
while(null != node && null != node.next) {
if(v == node.val) {
node.val = node.next.val;
node.next = node.next.next;
break;
} else {
node = node.next;
}
}
}
}