[算法]删除链表中重复的节点

/*
 public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}
*/
public class Solution {
    public ListNode deleteDuplication(ListNode pHead){
        if(pHead == null || pHead.next == null){
            return pHead;
        }
        ListNode head = new ListNode(-1);
        head.next = pHead;
        ListNode p = head;
        ListNode q = head.next;
        while(q != null){
            while(q.next != null && q.next.val == q.val){
                q = q.next;
            }
            if(p.next == q){
                p = q;
                q = q.next;
            }else{
                q = q.next;
                p.next = q;
            }
        }
        return head.next;
    }
}