83. Remove Duplicates from Sorted List
Easy
68575FavoriteShare
Given a sorted linked list, delete all duplicates such that each element appear only once.
Example 1:
Input: 1->1->2 Output: 1->2
Example 2:
Input: 1->1->2->3->3 Output: 1->2->3
AC答案如下:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
void jump(ListNode* now,ListNode* ans)
{
if(now==NULL)return;
else
{
if(now->val==ans->val)
{
return jump(now->next,ans);
}
else//不相等的情况,需要写入
{
ListNode* t=new ListNode(now->val);
ans->next=t;
return jump(now->next,t);
}
}
return;
}
ListNode* deleteDuplicates(ListNode* head) {
//思路是用两个指针,检查next是否等于now,如果等于,将快指针继续往下移,直到不等,慢指针移动一格
//结束条件:当快指针为空时,把慢指针的next变成空,返回root。
if(head==NULL)return head;
ListNode* ans=new ListNode(head->val);
jump(head->next,ans);
return ans;
}
};