-
-
Notifications
You must be signed in to change notification settings - Fork 300
/
203.java
99 lines (96 loc) · 2.37 KB
/
203.java
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
92
93
94
95
96
97
98
99
__________________________________________________________________________________________________
sample 0 ms submission
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode removeElements(ListNode head, int val) {
if(head == null){
return null;
}
while(head != null && head.val == val){
head = head.next;
}
if(head == null){
return null;
}
ListNode ans = head;
ListNode pre = head;
head = head.next;
while(head != null){
if(head.val == val){
while(head != null){
if(head.val != val){
break;
}
head = head.next;
}
if(head == null){
pre.next = null;
break;
}
pre.next = head;
pre = head;
head = head.next;
}else{
pre = head;
head = head.next;
}
}
return ans;
}
}
__________________________________________________________________________________________________
sample 36472 kb submission
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution
{
public ListNode removeElements(ListNode head, int val)
{
ListNode a = null;
ListNode b = head;
for(;b != null ;)
{
if(b.val != val)
{
if(a == null)
{
head = b;
}
a = b;
b = b.next;
}
else
{
b = b.next;
if(a != null && b != null && b.val != val)
{
a.next = b;
}
}
}
System.gc();
if (a == null)
{
return null;
}
else
{
a.next = b;
return head;
}
}
}
__________________________________________________________________________________________________