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
| class Solution {
public ListNode deleteNode(ListNode head, int val) {
if (head.next == null) {
if (head.val == val) {
return null;
} else {
return head;
}
}
if (head.val == val) {
head = head.next;
return head;
}
ListNode pre = head;
ListNode p = head.next;
while (p != null) {
if (p.val == val) {
pre.next = p.next;
return head;
} else {
p = p.next;
pre = pre.next;
}
}
return head;
}
}
|
