题解 | #删除有序链表中重复的元素-I#

import java.util.*;

/*
 * public class ListNode {
 *   int val;
 *   ListNode next = null;
 * }
 */

public class Solution {
    /**
     * 
     * @param head ListNode类 
     * @return ListNode类
     */
    public ListNode deleteDuplicates(ListNode head) {
        // write code here
        if (head == null || head.next == null) {
            return head;
        }

        //由于链表有序，平扫即可
        ListNode cur = head;
        ListNode tmp = cur;
        boolean flag = false;
        while (cur.next != null) {
            cur = cur.next;

            if (cur.val != tmp.val) {
                tmp.next = cur;
                tmp = cur;
            }
        }

        //当末尾是一串连续相同节点时，砍掉多余的
        if (cur != tmp && cur.val == tmp.val){
            tmp.next = null;
        }

        return head;
    }
}