83 删除排序链表中的重复元素
/**
* 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) {
ListNode* dummyNode = new ListNode(-1);
dummyNode->next = head;
ListNode* slow = dummyNode, *fast = head;
while(fast != nullptr){
if(fast->next != nullptr && fast->val == fast->next->val){
while(fast->next != nullptr && fast->val == fast->next->val){
fast = fast->next;
}
}else{
slow->next = fast;
slow = slow->next;
fast = fast->next;
}
}
slow->next = nullptr;
return dummyNode->next;
}
};
/**
* 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)
return nullptr;
ListNode* slow = head, * fast = head;
while(fast != nullptr){
if(slow->val != fast->val){
slow->next = fast;
slow = slow->next;
}
fast = fast->next;
}
// 注意链表末尾设为空
slow->next = nullptr;
return head;
}
};