LeetCode第三天

21.合并两个有序列表

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

class Solution:
    def mergeTwoLists(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        l4=l3=ListNode(0)
        while l1 and l2:
            if(l1.val>l2.val):
                l3.next=l2
                l2=l2.next
            else:
                l3.next=l1
                l1=l1.next
            l3=l3.next
        l3.next=l1 or l2
        return l4.next

26.删除排序数组中的重复项

class Solution:
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if(nums==[]):
            return 0
        i=1
        for n in nums:
            if(n!=nums[i-1]):
                nums[i]=n
                i+=1
        return i 

27.移除元素

class Solution:
    def removeElement(self, nums, val):
        """
        :type nums: List[int]
        :type val: int
        :rtype: int
        """
        count=0
        for n in nums:
            if(val==n):
                count+=1
        for i in range(count):
            nums.remove(val)
        return len(nums)