摘要: 139.单词拆分 思路: dp[i]表示s前i个字符能否完全拆分为wordDict中的"某几个单词"(即:未必是全部) https://leetcode-cn.com/problems/word-break/solution/shou-hui-tu-jie-san-chong-fang-fa-dfs 阅读全文
posted @ 2021-06-08 10:54 BigMonster85 阅读(104) 评论(0) 推荐(0)