leetcode 237. Delete Node in a Linked List

Seawolf

1. Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
   
2. 
   
3. Given linked list -- head = [4,5,1,9], which looks like following:
   
4. 
   
5. 
   
6. 
   
7. Example 1:
   
8. 
   
9. Input: head = [4,5,1,9], node = 5
   
10. Output: [4,1,9]
    
11. Explanation: You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.
    
12. Example 2:
    
13. 
    
14. Input: head = [4,5,1,9], node = 1
    
15. Output: [4,5,9]
    
16. Explanation: You are given the third node with value 1, the linked list should become 4 -> 5 -> 9 after calling your function.
    
17. 
    
18. 
    
19. Note:
    
20. 
    
21. The linked list will have at least two elements.
    
22. All of the nodes' values will be unique.
    
23. The given node will not be the tail and it will always be a valid node of the linked list.
    
24. Do not return anything from your function.

复制代码

1. /**
   
2. * Definition for singly-linked list.
   
3. * public class ListNode {
   
4. *     int val;
   
5. *     ListNode next;
   
6. *     ListNode(int x) { val = x; }
   
7. * }
   
8. */
   
9. class Solution {
   
10.     public void deleteNode(ListNode node) {
    
11.         
    
12.                      
    
13.         node.val = node.next.val;
    
14. 
    
15.         if(node.next.next != null){
    
16. 
    
17.             node.next = node.next.next;
    
18.             node = node.next;
    
19.         }
    
20. 
    
21.         else
    
22.             node.next = null;
    
23.             
    
24.         
    
25. 
    
26.     }
    
27.         
    
28.    
    
29. }

复制代码