原题连接:Leetcode 83. Remove Duplicates from Sorted List
Given the head of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well.
Example 1:
Input: head = [1,1,2]
Output: [1,2]
Example 2:
Input: head = [1,1,2,3,3]
Output: [1,2,3]
Constraints:
- The number of nodes in the list is in the range [0, 300].
- -100 <= Node.val <= 100
- The list is guaranteed to be sorted in ascending order.
方法一:一次遍历
思路:
因为题目中明确了,链表是已经排序的。
因此,重复元素一定是相邻的。
遍历一次链表,将相邻元素删除即可
c++代码:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
if(!head || head->next == NULL)
return head;
ListNode* cur = head;
while(cur->next != NULL){
// cur重复的话就将cur删除
if(cur->next->val == cur->val){
cur->next = cur->next->next;
}
// 往后移动一位
else
cur = cur->next;
}
return head;
}
};
复杂度分析:
- 时间复杂度:O(n),需要遍历链表的每个元素
- 空间复杂度:O(1),常数个临时变量