每日leetcode4.6（单词拆分+合并K个有序链表）-待更新

最新推荐文章于 2025-10-16 10:16:50 发布

原创最新推荐文章于 2025-10-16 10:16:50 发布 · 143 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#python

leetcode每日刷题专栏收录该内容

17 篇文章

订阅专栏

本文分享了如何使用动态规划解决LeetCode中的单词拆分问题，并提供了一种优化算法来合并K个已排序链表。通过实例展示了Python代码实现，适合前端、后端开发者进阶练习。

每日leetcode两题4.5-单词拆分

139、单词拆分

我的初步解法

from typing import List


class Solution:
    def match(self, s: str, y: str) -> bool:
        if len(s) < len(y):
            return False
        for i in range(len(y)):
            if s[i] != y[i]:
                return False
        return True

    def wordBreak(self, s: str, wordDict: List[str]) -> bool:
        l = len(s)
        dp = [[0] * (l + 1) for col in range(l + 1)]
        for i in range(l + 1):
            dp[i][i] = 1
        for j in range(1, l + 1):
            for i in range(l + 1 - j):
                for k in wordDict:
                    if dp[i][i + j] == 0 and self.match(s[i:i + j], k):
                        dp[i][i + j] = dp[i + len(k)][i + j]
        return dp[0][l] == 1


if __name__ == '__main__':
    x = Solution()
    s = 'applepenapple'
    wordDict = ["apple", "pen"]
    print(x.wordBreak(s, wordDict))
    print(x.match(s[0:8], wordDict[0]))

23、合并K个排序链表（hard）

初步解法如下，优化解法应该用优先队列，了解c++中的优先队列

from typing import List


class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next


class Solution:
    def mergeKLists(self, lists: List[ListNode]) -> ListNode:
        l = len(lists)
        ans = ListNode()
        temp = ans
        minI = 0
        while minI != -1:
            minL = 100000
            minI = -1
            for i in range(l):
                if lists[i] != None and lists[i].val < minL:
                    minL = lists[i].val
                    minI = i
            if minI != -1:
                temp.next = ListNode(minL)
                temp = temp.next
                lists[minI] = lists[minI].next
        return ans.next


if __name__ == '__main__':
    x = Solution()
    y = ListNode()
    y.next = ListNode(6)
    z = ListNode(3)
    z.next = ListNode(7)
    k = x.mergeKLists([y, z])
    print(k.val)