摘要: /*Given a string and dictionary of words, break the string into minimum number of words from the dictionary. Ex: {"jumped", "over", "some", "thing”, " 阅读全文
posted @ 2017-11-01 10:07 apanda009 阅读(543) 评论(0) 推荐(0) 编辑
摘要: 难度:90. 这道题跟Palindrome Partitioning非常类似,区别就是不需要返回所有满足条件的结果,而只是返回最小的切割数量就可以。做过Word Break的朋友可能马上就会想到,其实两个问题非常类似,当我们要返回所有结果(Palindrome Partitioning和Word B 阅读全文
posted @ 2017-11-01 08:30 apanda009 阅读(102) 评论(0) 推荐(0) 编辑