删除排序链表中的重复元素
问题描述
给定一个排序链表,删除所有重复的元素,使得每个元素只出现一次。
示例 :
- 输入: 1->1->2
输出: 1->2 - 输入: 1->1->2->3->3
输出: 1->2->3
Code1
时间复杂度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) return head;
ListNode dummy(head->val + 1);
dummy.next = head;
recur(&dummy, head);
return dummy.next;
}
private:
static void recur(ListNode *prev, ListNode *cur) {
if(cur == nullptr) return;
if(prev->val == cur->val) {
prev->next = cur->next;
delete cur;
recur(prev, prev->next);
} else {
recur(prev->next, cur->next);
}
}
};
Code2
时间复杂度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 == nullptr) return nullptr;
for(ListNode *prev = head, *cur = head->next; cur; cur = prev->next) {
if(prev->val == cur->val) {
prev->next = cur->next;
delete cur;
} else {
prev = cur;
}
}
return head;
}
};
若有疑问欢迎评论!