蓝色地中海

2017年5月11日

摘要： Problem statement: Given a 2D board and a list of words from the dictionary, find all words in the board. Each word must be constructed from letters o 阅读全文

posted @ 2017-05-11 08:26 蓝色地中海阅读(249) 评论(0) 推荐(0)

79. Word Search

摘要： Problem statement: Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent 阅读全文

posted @ 2017-05-11 05:29 蓝色地中海阅读(157) 评论(0) 推荐(0)

140. Word Break II

摘要： Problem statement: Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence 阅读全文

posted @ 2017-05-11 02:26 蓝色地中海阅读(190) 评论(0) 推荐(0)

2017年5月10日

132. Palindrome Partitioning II

摘要： Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioning 阅读全文

posted @ 2017-05-10 10:35 蓝色地中海阅读(156) 评论(0) 推荐(0)

131. Palindrome Partitioning

摘要： Problem statement: Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioni 阅读全文

posted @ 2017-05-10 10:28 蓝色地中海阅读(288) 评论(0) 推荐(0)

139. Word Break

摘要： Problem statement: 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 s 阅读全文

posted @ 2017-05-10 09:14 蓝色地中海阅读(435) 评论(0) 推荐(0)

2017年5月9日

5. Longest Palindromic Substring

摘要： Problem statement Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example: Example 阅读全文

posted @ 2017-05-09 09:17 蓝色地中海阅读(126) 评论(0) 推荐(0)

516. Longest Palindromic Subsequence

摘要： Problem statement: Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000. Exam 阅读全文

posted @ 2017-05-09 07:58 蓝色地中海阅读(180) 评论(0) 推荐(0)

31. Next Permutation

摘要： Problem statement: Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrang 阅读全文

posted @ 2017-05-09 07:04 蓝色地中海阅读(132) 评论(0) 推荐(0)

2017年5月8日

572. Subtree of Another Tree

摘要： Problem statement: Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. 阅读全文

posted @ 2017-05-08 10:16 蓝色地中海阅读(360) 评论(0) 推荐(0)

每一个卓尔不群和追求梦想的背后总有一个非凡的故事

公告