Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,
Given 1->1->2
, return 1->2
.
Given 1->1->2->3->3
, return 1->2->3
.
思路分析:
遍历链表,比较相邻结点pre和nex的值,相同则删除nex结点,并让nex指向nex的下一个节点。
时间复杂度:O(n)
空间复杂度:O(1)
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
if(head == NULL || head -> next == NULL) return head;
ListNode *pre = head;
ListNode *nex = head -> next;
while(nex){
if(pre -> val == nex -> val){//重复,删除nex
ListNode *p = nex;
pre -> next = nex -> next;
nex = nex -> next;
delete p;
continue;
}
pre = nex;
nex = nex -> next;
}
return head;
}
};