DFS
关注
分享
扫一扫
liujunlovecs
这个作者很懒，什么都没留下…
展开
-
Leetcode#22||Generate Parentheses
public class Solution { public List generateParenthesis(int n) { List result = new ArrayList(); if (n <= 0) { return result; } dfs(res原创 2015-08-12 15:59:42 · 284 阅读 · 0 评论 -
Unique Binary Search Tree II
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution {原创 2015-08-01 14:22:54 · 274 阅读 · 0 评论