【Leetcode】83. 删除排序链表中的重复元素

输入: 1->1->2
输出: 1->2

输入: 1->1->2->3->3
输出: 1->2->3

public class Solution {
    public ListNode deleteDuplicates(ListNode head) {
        ListNode list = head;

         while(list != null) {
             if (list.next == null) {
                 break;
             }
             if (list.val == list.next.val) {
                 list.next = list.next.next;
             } else {
                 list = list.next;
             }
         }

         return head;
    }
}

class Solution:
    def deleteDuplicates(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        l = head
        while l is not None:
            if l.next is None:
                break
            if l.val == l.next.val:
                l.next = l.next.next
            else:
                l = l.next
        return head