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

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

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