2016年9月16日
78. Subsets
摘要： Given a set of distinct integers, nums, return all possible subsets. Note: The solution set must not contain duplicate subsets. For example,If nums =  阅读全文
posted @ 2016-09-16 12:02 咖啡中不塌缩的方糖 阅读(135) 评论(0) 推荐(0)
254. Factor Combinations
摘要： Numbers can be regarded as product of its factors. For example, Write a function that takes an integer n and return all possible combinations of its f 阅读全文
posted @ 2016-09-16 11:49 咖啡中不塌缩的方糖 阅读(123) 评论(0) 推荐(0)
267. Palindrome Permutation II
摘要： Given a string s, return all the palindromic permutations (without duplicates) of it. Return an empty list if no palindromic permutation could be form 阅读全文
posted @ 2016-09-16 10:29 咖啡中不塌缩的方糖 阅读(201) 评论(0) 推荐(0)
131. 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. For exampl 阅读全文
posted @ 2016-09-16 09:20 咖啡中不塌缩的方糖 阅读(107) 评论(0) 推荐(0)
17. Letter Combinations of a Phone Number
摘要： Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telepho 阅读全文
posted @ 2016-09-16 09:07 咖啡中不塌缩的方糖 阅读(211) 评论(0) 推荐(0)