# Remove Duplicates from Sorted List II

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.

For example,
Given `1->2->3->3->4->4->5`, return `1->2->5`.
Given `1->1->1->2->3`, return `2->3`.

```/**
* public class ListNode {
*     int val;
*     ListNode next;
*     ListNode(int x) { val = x; }
* }
*/
public class Solution {
}
ListNode temp = new ListNode(0);
ListNode pre = temp;
boolean flag = false;
while (nex != null) {
if (cur.val == nex.val) {
flag = true;
nex = nex.next;
if (nex == null) {
pre.next = null;
}
} else {
if (flag) {
pre.next = nex;
flag = false;
} else {
pre = cur;
}
cur = nex;
nex = nex.next;
}
}
return temp.next;
}
}```

Remove Duplicates from Sorted List II

• 0

开心

• 0

板砖

• 0

感动

• 0

有用

• 0

疑问

• 0

难过

• 0

无聊

• 0

震惊

1 题目 Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only
Given a sorted linked list, delete all duplicates such that each element appear only once. Fo
Follow up for "Remove Duplicates": What if duplicates are allowed at most twice? For example,
Question: Follow up for "Remove Duplicates": What if duplicates are allowed at most twice? Fo
Given a sorted linked list, delete all duplicates such that each element appear only once. Fo

1 题目 Given a sorted linked list, delete all duplicates such that each element appear only o
Remove Duplicates from Sorted Array Given a sorted array, remove the duplicates in place such
Question: Given a sorted array, remove the duplicates in place such that each element appear