davidnyc

2018年4月3日

摘要： https://leetcode.com/problems/combination-sum-ii/description/Given a collection of candidate numbers (C) and a target number (T), find all unique comb 阅读全文

posted @ 2018-04-03 04:11 davidnyc 阅读(126) 评论(0) 推荐(0)

LC.39.Combination Sum

摘要： https://leetcode.com/problems/combination-sum/description/ Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all 阅读全文

posted @ 2018-04-03 02:51 davidnyc 阅读(118) 评论(0) 推荐(0)

LC.77.Combinations

摘要： https://leetcode.com/problems/combinations/description/Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.For example,If n = 4 and k = 2, a solution is:[ [2,4], ... 阅读全文

posted @ 2018-04-03 00:27 davidnyc 阅读(104) 评论(0) 推荐(0)

2018年4月2日

LF.63.All SubsetsII

摘要： Given a set of characters represented by a String, return a list containing all subsets of the characters.AssumptionsThere could be duplicate characters in the original set.ExamplesSet = "abc", all t... 阅读全文

posted @ 2018-04-02 09:21 davidnyc 阅读(145) 评论(0) 推荐(0)

LF.64.All Permutations I

摘要： Given a string with no duplicate characters, return a list with all permutations of the characters. Examples Set = “abc”, all permutations are [“abc”, 阅读全文

posted @ 2018-04-02 05:56 davidnyc 阅读(178) 评论(0) 推荐(0)

LF.66.All Valid Permutations Of Parentheses I

摘要： same as LC.22. Generate Parentheseshttps://leetcode.com/problems/generate-parentheses/description/ Given N pairs of parentheses “()”, return a list wi 阅读全文

posted @ 2018-04-02 05:03 davidnyc 阅读(243) 评论(0) 推荐(0)

LF.73.Combinations Of Coins

摘要： Given a number of different denominations of coins (e.g., 1 cent, 5 cents, 10 cents, 25 cents), get all the possible ways to pay a target number of ce 阅读全文

posted @ 2018-04-02 04:20 davidnyc 阅读(225) 评论(0) 推荐(0)

2018年4月1日

LC.78. + LF.62. SubsetsI

摘要： Given a set of distinct integers, nums, return all possible subsets (the power set). Note: The solution set must not contain duplicate subsets. For ex 阅读全文

posted @ 2018-04-01 22:34 davidnyc 阅读(156) 评论(0) 推荐(0)

LF.391.Determine If Array Is Min Heap

摘要： Determine if the given integer array is min heap. 阅读全文

posted @ 2018-04-01 07:49 davidnyc 阅读(199) 评论(0) 推荐(0)

2018年3月31日

LF.19.K Closest In Sorted Array

摘要： Given a target integer T, a non-negative integer K and an integer array A sorted in ascending order, find the K closest numbers to T in A. Assumptions 阅读全文

posted @ 2018-03-31 23:38 davidnyc 阅读(190) 评论(0) 推荐(0)

公告