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 蓝色地中海 阅读(162) 评论(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 蓝色地中海 阅读(291) 评论(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 蓝色地中海 阅读(436) 评论(0) 推荐(0)