/
Solution.kt
45 lines (42 loc) · 1.28 KB
/
Solution.kt
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
package g0001_0100.s0082_remove_duplicates_from_sorted_list_ii
// #Medium #Two_Pointers #Linked_List #Data_Structure_II_Day_11_Linked_List
// #Algorithm_II_Day_3_Two_Pointers #2023_07_10_Time_166_ms_(89.47%)_Space_36.8_MB_(63.16%)
import com_github_leetcode.ListNode
/*
* Example:
* var li = ListNode(5)
* var v = li.`val`
* Definition for singly-linked list.
* class ListNode(var `val`: Int) {
* var next: ListNode? = null
* }
*/
class Solution {
fun deleteDuplicates(head: ListNode?): ListNode? {
if (head == null || head.next == null) {
return head
}
val dummy = ListNode(0)
var prev: ListNode? = dummy
prev!!.next = head
var curr = head.next
while (curr != null) {
var flagFoundDuplicate = false
while (curr != null && prev!!.next!!.`val` == curr.`val`) {
flagFoundDuplicate = true
curr = curr.next
}
if (flagFoundDuplicate) {
prev!!.next = curr
if (curr != null) {
curr = curr.next
}
} else {
prev = prev!!.next
prev!!.next = curr
curr = curr!!.next
}
}
return dummy.next
}
}