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.
有序鏈表去重，兩個指針，一次遍歷，一個指針tail1指向原鏈表尾部，一個指針tail2指向去重后的鏈表尾部，如果tail1的val和tail2的val不一樣，則說名這個沒出現過，就把這個tail1的val移動到tail2的下一個節點的val上。
/**
* 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 == NULL)
return head;
ListNode* tail1 = head->next;
ListNode* tail2 = head;
while(tail1 != NULL)
{
if(tail1->val != tail2->val)
{
tail2->next->val = tail1->val;
tail2 = tail2->next;
}
tail1 = tail1->next;
}
tail2->next = NULL;
return head;
}
};
