2019年2月21日
leetcode 139. 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 sequ 阅读全文
posted @ 2019-02-21 21:19 JamieLiu 阅读(145) 评论(0) 推荐(0)
31. Next Permutation
摘要： Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possib 阅读全文
posted @ 2019-02-21 17:51 JamieLiu 阅读(94) 评论(0) 推荐(0)