-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
82.java
63 lines (62 loc) · 1.87 KB
/
82.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
__________________________________________________________________________________________________
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 deleteDuplicates(ListNode head) {
if (head == null) return null;
ListNode dummy = new ListNode(0 == head.val ? 1 : 0);
dummy.next = head;
ListNode pre = dummy, cur = head;
ListNode ptr = dummy;
while (cur != null && cur.next != null) {
if (pre.val != cur.val && cur.val != cur.next.val) {
ptr.next = cur;
ptr = ptr.next;
}
pre = cur;
cur = cur.next;
}
if (pre.val != cur.val) {
ptr.next = cur;
ptr = ptr.next;
}
ptr.next = null;
return dummy.next;
}
}
__________________________________________________________________________________________________
sample 34244 kb submission
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode deleteDuplicates(ListNode head) {
ListNode dummyHead = new ListNode(0);
dummyHead.next = head;
HashMap<Integer,Integer> map = new HashMap<>();
for(ListNode i = head;i!=null;i = i.next){
map.put(i.val,map.getOrDefault(i.val,0)+1);
}
for(ListNode i = dummyHead;i!=null;i = i.next){
ListNode g = i.next;
while(g!=null && map.get(g.val)>1){
g=g.next;
}
i.next = g;
}
return dummyHead.next;
}
}
__________________________________________________________________________________________________