LeetCode83. 删除排序链表中的重复元素(java）

题目：

给定一个排序链表，删除所有重复的元素，使得每个元素只出现一次。

示例：

代码：

• 解法一

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode deleteDuplicates(ListNode head) {
        if(head==null){	
            return head;
        }
        ListNode p1=head;
        ListNode root=new ListNode(0);
        ListNode rear=root;
        rear.next=head;
        rear=head;
        p1=p1.next;
        rear.next=null;
        while(p1!=null){
            if(p1.val!=rear.val){
                rear.next=p1;
                rear=p1;
                p1=p1.next;
                rear.next=null;
            }else{
                p1=p1.next;
            }
        }
        return root.next;
    }
}

解法思路：

• 解法二

//与解法一的思路一致
/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode deleteDuplicates(ListNode head) {
        ListNode current = head;
    while (current != null && current.next != null) {
        if (current.next.val == current.val) {
            current.next = current.next.next;
        } else {
            current = current.next;
        }
    }
    return head;
    }
}

• 别人的代码

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
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;
        } else {
            while ((head = head.next).next != null && (head.val == head.next.val)) {
            }
            return deleteDuplicates(head);
        }
    }
}