leetcode_83. Remove Duplicates from Sorted List

题目：

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.

简单的指针操作。指针操作一直不太熟练，练习一下：

/**
 * 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* node;
        node = head->next;
        ListNode* prenode;
        prenode = head;
        while(node!=NULL){
            if(node->val == prenode->val){
                ListNode *dNode = node;
                node = node->next;
                prenode->next = node;
                delete dNode;
            }
            else{
                prenode = node;
                node = node->next;
            }
        }
        return head;
    }
};