题目如下
该题目用到了递归的方法,写的很巧妙。
/** * Definition for singly-linked list.
* public class ListNode {
* * public int val;
* * public ListNode next;
* * public ListNode(int x) { val = x; }
* * }
* */public class Solution {
* public ListNode DeleteDuplicates(ListNode head) {
* if(head==null||head.next==null)
* {return head;}
* if(head.val==head.next.val)
* {head.next=DeleteDuplicates(head.next);
* return head.next;}
* else
* {head.next=DeleteDuplicates(head.next);
* return head;}
* }
* }