Leetcode: Unique Binary Search Trees

最新推荐文章于 2024-09-15 15:29:37 发布

YMHH

最新推荐文章于 2024-09-15 15:29:37 发布

阅读量673

点赞数

分类专栏： Leetcode 文章标签： leetcode 二叉树

本文链接：https://blog.csdn.net/ymhhym/article/details/17405437

版权

Leetcode 专栏收录该内容

249 篇文章 0 订阅

订阅专栏

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.

   1         3     3      2      1
    \       /     /      / \      \
     3     2     1      1   3      2
    /     /       \                 \
   2     1         2                 3

找个简单的，睡前保持好心情。

class Solution {
public:
    int numTrees(int n) {
        if (n < 0) {
            return 0;
        }
        if (n == 0 || n == 1) {
            return 1;
        }
        
        int sum = 0;
        // Each value can be the root
        for (int i = 1; i <= n; i++) {
            sum += numTrees(i-1) * numTrees(n-i);
        }
        
        return sum;
    }
};

=========================第二次====================

class Solution {
public:
    int numTrees(int n) {
        if (n < 0) {
            return 0;
        }
        else if (n == 0 || n == 1) {
            return 1;
        }
        else {
            int result = 0;
            for (int i = 0; i < n; ++i) {
                result += numTrees(i) * numTrees(n-i-1);
            }
            return result;
        }
    }
};