给出 1->1->2->null,返回 1->2->null
给出 1->1->2->3->3->null,返回 1->2->3->null
class Solution {
public:/**
* @param head: The first node of linked list.
* @return: head node
*/
ListNode *deleteDuplicates(ListNode *head) {
// write your code here
ListNode *p;
p = head;
if ( head == NULL ) {
return NULL;
}
while ( p -> next != NULL ) {
if ( p ->val == p -> next -> val ) {
p -> next = p -> next -> next;
ListNode *deleteDuplicates(ListNode *head);
} else {
p = p -> next;
ListNode *deleteDuplicates(ListNode *p);
}
}
return head;
}
};