-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy path237.DeleteNodeInALinkedList.cpp
91 lines (90 loc) · 1.83 KB
/
237.DeleteNodeInALinkedList.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
/*
* @lc app=leetcode id=237 lang=cpp
*
* [237] Delete Node in a Linked List
*
* https://leetcode.com/problems/delete-node-in-a-linked-list/description/
*
* algorithms
* Easy (66.74%)
* Likes: 2354
* Dislikes: 8614
* Total Accepted: 567.6K
* Total Submissions: 849.9K
* Testcase Example: '[4,5,1,9]\n5'
*
* Write a function to delete a node in a singly-linked list. You will not be
* given access to the head of the list, instead you will be given access to
* the node to be deleted directly.
*
* It is guaranteed that the node to be deleted is not a tail node in the
* list.
*
*
* Example 1:
*
*
* Input: head = [4,5,1,9], node = 5
* Output: [4,1,9]
* Explanation: You are given the second node with value 5, the linked list
* should become 4 -> 1 -> 9 after calling your function.
*
*
* Example 2:
*
*
* Input: head = [4,5,1,9], node = 1
* Output: [4,5,9]
* Explanation: You are given the third node with value 1, the linked list
* should become 4 -> 5 -> 9 after calling your function.
*
*
* Example 3:
*
*
* Input: head = [1,2,3,4], node = 3
* Output: [1,2,4]
*
*
* Example 4:
*
*
* Input: head = [0,1], node = 0
* Output: [1]
*
*
* Example 5:
*
*
* Input: head = [-3,5,-99], node = -3
* Output: [5,-99]
*
*
*
* Constraints:
*
*
* The number of the nodes in the given list is in the range [2, 1000].
* -1000 <= Node.val <= 1000
* The value of each node in the list is unique.
* The node to be deleted is in the list and is not a tail node
*
*
*/
// @lc code=start
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
void deleteNode(ListNode* node) {
node->val = node->next->val;
node->next = node->next->next;
}
};
// @lc code=end