【leetcode】P83去除有序链表重复元素

//给定一个排序链表，删除所有重复的元素，使得每个元素只出现一次。 
//
// 示例 1: 
//
// 输入: 1->1->2
//输出: 1->2
// 
//
// 示例 2: 
//
// 输入: 1->1->2->3->3
//输出: 1->2->3 
// Related Topics 链表 
// 👍 417 👎 0

package leetcode.editor.cn;

//Java：删除排序链表中的重复元素
public class P83RemoveDuplicatesFromSortedList {
    public static void main(String[] args) {
        P83RemoveDuplicatesFromSortedList p83 = new P83RemoveDuplicatesFromSortedList();
        // TO TEST
        Solution solution = p83.new Solution();
        ListNode head = p83.new ListNode(1);
        head.next = p83.new ListNode(1);
        head.next.next = p83.new ListNode(2);
        head.next.next.next = p83.new ListNode(3);
        head.next.next.next.next = p83.new ListNode(3);
        ListNode listNode = solution.deleteDuplicates(head);
        printList(listNode);
    }
    //leetcode submit region begin(Prohibit modification and deletion)

    /**
     * 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 cur = head;
            while (cur != null) {
                while (cur.next != null && cur.val == cur.next.val)
                    cur.next = cur.next.next;
                cur = cur.next;
            }
            return head;
        }


    }

//    class ListNode {
//        int val;
//        ListNode next;
//
//        public ListNode(int x) {
//            val = x;
//        }
//    }

//    public static void printList(ListNode head) {
//        while (head != null) {
//            System.out.print(head.val + " ");
//            head = head.next;
//        }
//    }

    //leetcode submit region end(Prohibit modification and deletion)

}