237 Delete Node in a Linked List

Search…

237. Delete Node in a Linked List​
1. Question
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 is1 -> 2 -> 3 -> 4and you are given the third node with value3, the linked list should become1 -> 2 -> 4after calling your function.
2. Implementation
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
public class Solution {
10
    public void deleteNode(ListNode node) {
11
        if (node == null || node.next == null) {
12
            return;
13
        }
14
​
15
        node.val = node.next.val;
16
        node.next = node.next.next;
17
    }
18
}
Copied!
3. Time & Space Complexity
时间复杂度O(1), 空间复杂度O(1)

234 Palindrome Linked List

328 Odd Even Linked List

Last modified 2yr ago

Copy link

Contents

237. Delete Node in a Linked List

1. Question

2. Implementation

3. Time & Space Complexity

237. Delete Node in a Linked List​

1. Question

2. Implementation

3. Time & Space Complexity

237. Delete Node in a Linked List