/**
* 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) {
auto temp = head;
while(temp && temp->next)
{
if(temp->next->val == temp->val)
{
temp->next = temp->next->next;
}
else
{
temp = temp->next;
}
}
return head;
}
};
leetcode | 83题 | 删除排序链表中的重复元素
最新推荐文章于 2022-03-14 21:31:47 发布