给定一个排序链表,删除所有重复的元素只留下原链表中没有重复的元素。
样例
给出 1->2->3->3->4->4->5->null,返回 1->2->5->null
给出 1->1->1->2->3->null,返回 2->3->null
一刷ac
解题思路:设置一个标志位代表是否存在重复,然后拼接链表。
/**
* Definition for ListNode
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
/**
* @param ListNode head is the head of the linked list
* @return: ListNode head of the linked list
*/
public static ListNode deleteDuplicates(ListNode head) {
if(head == null) return head;
ListNode dummy = new ListNode(0);
ListNode node = dummy;
int flag = 0;
while(head != null){
if(head.next != null){
if(head.next.val == head.val){
head = head.next;
flag = 1;
}else{
if(flag == 0){
node.next = head;
node = node.next;
head = head.next;
}else{
head = head.next;
flag = 0;
}
}
}
else{
if(flag == 0){
node.next = head;
node = node.next;
head = head.next;
}else{
node.next = null;
head = head.next;
}
}
}
return dummy.next;
}
}
简洁版
/**
* Definition for ListNode
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
/**
* @param ListNode head is the head of the linked list
* @return: ListNode head of the linked list
*/
public static ListNode deleteDuplicates(ListNode head) {
if(head == null) return head;
ListNode dummy = new ListNode(0);
ListNode node = dummy;
dummy.next = head;
while(head != null){
while(head.next != null && head.next.val == head.val) head = head.next;
if(node.next == head){
head = head.next;
node = node.next;
}else{
node.next = head.next;
head = head.next;
}
}
return dummy.next;
}
}