删除排序链表中重复的节点 递归方式

思路比较简单，直接看代码

/*
 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;
        if(pHead.val == pHead.next.val){//第一个节点是重复节点，则跳过重复节点
            ListNode node = pHead.next;
            while(node != null&&node.val == pHead.val)
                node = node.next;
            return deleteDuplication(node);
        }else{
            //第一个节点不是重复节点
            pHead.next = deleteDuplication(pHead.next);
            return pHead;
        }
    }
}