[LeetCode] Unique Binary Search Trees II

最新推荐文章于 2024-10-14 18:52:56 发布

lyangpku

最新推荐文章于 2024-10-14 18:52:56 发布

阅读量434

点赞数

分类专栏： LeetCode 算法递归面试题文章标签： Leetcode leetcode LeetCode 算法递归面试题

本文链接：https://blog.csdn.net/lyangpku/article/details/8550440

版权

LeetCode 同时被 3 个专栏收录

110 篇文章 0 订阅

订阅专栏

算法

110 篇文章 0 订阅

订阅专栏

面试题

110 篇文章 0 订阅

订阅专栏

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    void recursion(vector<TreeNode *> &v, int s, int t) {
        if (s > t) {
            v.push_back(NULL);
            return;
        }
        
        for (int p = s; p <= t; p++) {
            vector<TreeNode *> leftChild;
            vector<TreeNode *> rightChild;
            
            recursion(leftChild, s, p - 1);
            recursion(rightChild, p + 1, t);
            
            for (int i = 0; i < leftChild.size(); i++)
            for (int j = 0; j < rightChild.size(); j++) {
                TreeNode *parent = new TreeNode(p);
                parent->left  = leftChild[i];
                parent->right = rightChild[j];
                v.push_back(parent);
            }
        }
    }
    
    vector<TreeNode *> generateTrees(int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<TreeNode *> ret;
        recursion(ret, 1, n);
        return ret;
    }
};

Small Case: 0ms

Large Case: 120ms