Java for LeetCode 096 Unique Binary Search Trees
2015-05-21 17:35
513 查看
Given n, how many structurally unique BST's (binary search trees) that store values 1...n?
For example,
Given n = 3, there are a total of 5 unique BST's.
解题思路:
二叉查找树,刚上来无从下手,但仔细想想就能发现规律:以i为根节点,i的左子树都是小于i的,共有numTrees(i-1)种情况,i的右子树都是大于i的,共有numTrees(n-i) 种情况,相乘即是以i为根节点的情况,然后依次循环即可,递归下即可解决。当然更高效的方式是采用DP来替代递归,JAVA实现如下:
For example,
Given n = 3, there are a total of 5 unique BST's.
解题思路:
二叉查找树,刚上来无从下手,但仔细想想就能发现规律:以i为根节点,i的左子树都是小于i的,共有numTrees(i-1)种情况,i的右子树都是大于i的,共有numTrees(n-i) 种情况,相乘即是以i为根节点的情况,然后依次循环即可,递归下即可解决。当然更高效的方式是采用DP来替代递归,JAVA实现如下:
public int numTrees(int n) { if (n <= 0) return 0; int[] dp = new int[n + 1]; dp[0] = 1; for (int i = 1; i < dp.length; i++) for (int k = 0; k <= i - 1; k++) dp[i] += dp[k] * dp[i - k - 1]; return dp ; }
相关文章推荐
- Java for LeetCode 095 Unique Binary Search Trees II
- 【LeetCode-面试算法经典-Java实现】【096-Unique Binary Search Trees(唯一二叉搜索树)】
- 【LeetCode-面试算法经典-Java实现】【096-Unique Binary Search Trees(唯一二叉搜索树)】
- [LeetCode]题解(python):096-Unique Binary Search Trees
- [Leetcode] Unique Binary Search Trees II (Java)
- LeetCode 096 Unique Binary Search Trees
- leetcode JAVA Unique Binary Search Trees 难度系数3 3.34
- leetcode_c++:树: Unique Binary Search Trees(096)
- LeetCode: Unique Binary Search Trees II [096]
- leetcode JAVA Unique Binary Search Trees II 4.28 难度系数4
- LeetCode096 Unique Binary Search Trees
- LeetCode 96 — Unique Binary Search Trees(C++ Java Python)
- [LeetCode][Java]Unique Binary Search Trees II
- leetcode Unique Binary Search Trees II java
- LeetCode 096 Unique Binary Search Trees
- 096 Unique Binary Search Trees [Leetcode]
- LeetCode96_Unique Binary Search Trees(求1到n这些节点能够组成多少种不同的二叉查找树) Java题解
- Unique Binary Search Trees leetcode java
- leetcode-java-95. Unique Binary Search Trees II
- [Leetcode] Unique Binary Search Trees (Java)