删除有序链表中的重复节点

//表示对递归掌握的不是很熟，链表的操作好多都是递归实现！！！是时候好好学学递归了

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.

* public class ListNode {

* int val;

* ListNode next;

* ListNode(int x) { val = x; }

* }

*/

public class Solution {

public ListNode deleteDuplicates(ListNode head) {

if(head == null || head.next == null)

return head;

head.next = deleteDuplicates(head.next);

return head.val == head.next.val ? head.next : head;

}

}