Recursion
文章平均质量分 60
WayneShan
这个作者很懒,什么都没留下…
展开
-
【LeetCode】【JAVA】【048】Combinations
题目: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], [3,4], [2,3], [1,2], [1,3], [1,原创 2015-02-24 00:36:41 · 198 阅读 · 0 评论 -
【LeetCode】【JAVA】【050】Sum Root to Leaf Numbers
题目:Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the total原创 2015-02-24 06:57:27 · 121 阅读 · 0 评论 -
【LeetCode】【JAVA】【052】Path Sum
题目:Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree a原创 2015-02-24 07:48:35 · 152 阅读 · 0 评论 -
【LeetCode】【JAVA】【070】Unique Binary Search Trees II
题目:Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your program should return all 5 unique BST's shown below. 1原创 2015-03-26 14:23:05 · 124 阅读 · 0 评论 -
【LeetCode】【JAVA】【065】Combination Sum
题目:Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen from C unlimited num原创 2015-03-24 23:53:04 · 202 阅读 · 0 评论 -
【LeetCode】【JAVA】【077】Path Sum II
题目:Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree and sum = 22, 5原创 2015-04-03 09:42:14 · 159 阅读 · 0 评论 -
【LeetCode】【JAVA】【085】Word Break II
题目:https://leetcode.com/problems/word-break-ii/思路:直接用 Recursion超时。取 Word Break 的思路,先 DP 获得 jth 位置可达到的 index,再通过 Recursion 获得所有结果。Code:public class Solution { ArrayList resAL;原创 2015-04-29 23:29:34 · 174 阅读 · 0 评论