
DFS
Peng_maple
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
[leetcode] 97. Interleaving String
Interleaving String Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. Example 1: Input: s1 = “aabcc”, s2 = “dbbca”, s3 = “aadbbcbcac” Output: true Example 2: Input: s1 =...原创 2019-08-01 20:02:54 · 228 阅读 · 0 评论 -
[leetcode] 130. Surrounded Regions
Surrounded Regions Given a 2D board containing ‘X’ and ‘O’ (the letter O), capture all regions surrounded by ‘X’. A region is captured by flipping all 'O’s into 'X’s in that surrounded region. Example...原创 2019-08-16 15:30:42 · 127 阅读 · 0 评论 -
[leetcode] 131. Palindrome Partitioning
Palindrome Partitioning Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. Example: Input: “aab” Output: [ [“a...原创 2019-08-16 16:48:42 · 172 阅读 · 0 评论 -
[leetcode] 139. Word Break
Word Break Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words. N...原创 2019-08-17 11:25:40 · 227 阅读 · 0 评论