LeetCode NO.83 cpp(4.2)

标签：链表，每个元素只出现一次

/**
 * 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* head_bak = head;
    	while(head_bak && head_bak->next){
    		if(head_bak->val == head_bak->next->val){
    			head_bak->next = head_bak->next->next;
    		}else{
    			head_bak = head_bak->next;
    		}
    	}
    	return head;
    }
};