LeetCode50题第5天

LeetCode第23题: 合并K个升序链表

解法一

1. 使用合并两个顺序链表的方法来合并k个链表

class Solution:
    def mergeKLists(self, lists) -> ListNode:
        if len(lists) == 0:
            return None
        # print(len(lists))
        i = 1
        while i < len(lists):
            lists[0] = self.mergeTwoLists(lists[0], lists[i])
            i += 1
        return lists[0]

    def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
        i = ListNode()
        i.next = l1
        pi = i
        j = ListNode()
        j.next = l2
        pj = j
        while pi.next != None and pj.next != None:
            if pi.next.val <= pj.next.val:
                pi = pi.next
            else:
                mid = pj.next.next
                pj.next.next = pi.next
                pi.next = pj.next
                pj.next = mid
                pi = pi.next
        if pj.next != None:
            pi.next = pj.next
        return i.next

解法二

1. 解法一会重复比较合并的元素, 使用分治可以有效降低重复度
2. 即两两合并未合并的链表, 而不是用第一个链表合并其他所有链表

class Solution:
    def mergeKLists(self, lists) -> ListNode:
        if len(lists) == 0:
            return None
        length = len(lists)
        while length > 1:
            i = 1
            j = 0
            # print(3)
            while i < length:
                # print(1)
                lists[j] = self.mergeTwoLists(lists[i - 1], lists[i])
                # print(4)
                i += 2
                j += 1
            if length & 1 == 1:
                lists[j] = lists[i - 1]
            length = length // 2 if length % 2 == 0 else (length // 2) + 1
        # print(2)
        return lists[0]

    def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
        i = ListNode()
        i.next = l1
        pi = i
        j = ListNode()
        j.next = l2
        pj = j
        while pi.next != None and pj.next != None:
            if pi.next.val <= pj.next.val:
                pi = pi.next
            else:
                mid = pj.next.next
                pj.next.next = pi.next
                pi.next = pj.next
                pj.next = mid
                pi = pi.next
        if pj.next != None:
            pi.next = pj.next
        return i.next

LeetCode第26题: 删除排序数组中的重复项

1. 使用双指针法, 即一个指针找出不重复元素, 另一个指针赋值元素, 且代表数组的真实长度

class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
        i = 1
        j = 1
        length = len(nums)
        while i < length:
            if nums[i] != nums[i - 1]:
                nums[j] = nums[i]
                j += 1
            i += 1
        return j

LeetCode第33题: 搜索旋转排序数组

1. 先对折, 如果target比第一个元素小, 就从后往前找, 否则从前往后找

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        length = len(nums)
        if nums[0] > target:
            i = length - 1
            while nums[i] > target and nums[i] > nums[i - 1] and i > 0:
                i -= 1
            return i if nums[i] == target else -1
        if nums[0] < target:
            if nums[length - 1] == target:
                return length - 1
            i = 0
            while nums[i] < target and i < length - 1 and nums[i] < nums[i + 1]:
                i += 1
            return i if nums[i] == target else -1
        return 0