/**
* 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 head;
}
ListNode* Cur = head;
while(Cur->next != nullptr)
{
if(Cur->val==Cur->next->val)
{
Cur->next = Cur->next->next;
}
else
{
Cur = Cur->next;
}
}
return head;
}
};
leetcode每日一题第十三天
最新推荐文章于 2024-05-31 13:35:03 发布