討論串[閒聊] 每日LeetCode
共 719 篇文章
內容預覽:
139. Word Break. Given a string s and a dictionary of strings wordDict, return true if s can be. segmented into a space-separated sequence of one or m
(還有968個字)
內容預覽:
17. Letter Combinations of a Phone Number. Given a string containing digits from 2-9 inclusive, return all possible. letter combinations that the numb
(還有1395個字)
內容預覽:
https://leetcode.com/problems/permutations/submissions/1009963724/. 46. Permutations. 給你一個陣列 nums，求出所有的排列。. Example 1:. Input: nums = [1,2,3]. Output:
(還有1140個字)
內容預覽:
https://leetcode.com/problems/combinations/. 77. Combinations. 給你一個數字 n 和 k ，返回 Cnk 的組合。. Example 1:. Input: n = 4, k = 2. Output: [[1,2],[1,3],[1,4],
(還有1037個字)
內容預覽:
https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/description/712. Minimum ASCII Delete Sum for Two Strings. 給你兩個字串 s1 和 s2，求出被刪除
(還有2116個字)