问题: 链接
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
.
字符串操作。
代码:
*/
class Solution {
public:
ListNode *deleteDuplicates(ListNode *head) {
ListNode *result = head;
if(head == NULL)
return head;
while(head->next != NULL)
{
if(head->next->val == head->val)
{
head->next = head->next->next;
}
else
{
head = head->next;
}
}
return result;
}
};