leetcode083-python 删除链表中重复元素

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:

• The number of elements initialized in nums1 and nums2 are m and n respectively.
• You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.

Example:

Input:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6],       n = 3

Output: [1,2,2,3,5,6]

---

解题要点：

1.题中定义的链表head是指向第一个元素的指针，只要定义两个指针相比较，遇到重复的删去就行。

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None


class Solution:
    def deleteDuplicates(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        if not head:
            return []
        i = head
        j = head
        while j.next!= None:
            j = j.next
            # if i.value ==j.value:
            #     j = j.next
            if i.val != j.val:
                i.next = j
                i = i.next
            elif i.val == j.val and j.next ==None:
                i.next = None
                
        return head