标签：
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.
Subscribe to see which companies asked this question
/** * 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)return head; ListNode *pre = head, *current = pre->next; while (current) { if (current->val == pre->val) { pre->next = current->next; free(current); current = pre->next; } else { current = current->next; pre = pre->next; } } return head; } };
LeetCode 83. Remove Duplicates from Sorted List
标签：
原文地址：http://www.cnblogs.com/csudanli/p/5877282.html
