题目： Given a sorted linked list, delete all duplicates such that each element appear only once.
For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3.
******************************我是一条分割线***************************
/**
* 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) {
if(!head || !head->next)
return head;
ListNode* heads=head;
while(heads)
{
if(heads->next!=NULL && heads->
val==heads->next->
val)
{
ListNode* temp=heads->next;
heads->next=temp->next;
}
else
heads=heads->next;
}
return head;
}
};
测试程序在24题里面有哈，直接加进去就可以测试啦~~~
转载请注明原文地址: https://ju.6miu.com/read-1125272.html
