【leetcode】 Unique Binary Search Trees II (middle)☆

weixin_34402090發表於2014-12-09
LeetCode

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         3     3      2      1
    \       /     /      / \      \
     3     2     1      1   3      2
    /     /       \                 \
   2     1         2                 3

這次的題目要求是得到所有的樹。

 

我的思路：

用f[n]儲存1-n的所有方法的根節點

則 f[n+1] = 1作為根，f[0]做左子樹，f[n]所有節點都加1做右子樹  +  2作為根，f[1]做左子樹，f[n - 1]所有節點都加2做右子樹 +...

程式碼記憶體都沒有釋放，不過AC了。

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
using namespace std;


// Definition for binary tree
 struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 };

class Solution {
public:
    vector<TreeNode *> generateTrees(int n) {
        vector<vector<TreeNode *>> ans(n + 1, vector<TreeNode *>());
        if(n == 0)
        {
            ans[0].push_back(NULL);
            return ans[0];
        }
        
        TreeNode * root = NULL;
        ans[0].push_back(root);
        root = new TreeNode(1);
        ans[1].push_back(root);
        for(int i = 2; i <= n; i++) //總數字
        {
            for(int j = 0; j < i; j++) //小於根節點的數字個數
            {
                for(int l = 0; l < ans[j].size(); l++) //小於根節點的組成方法數
                {
                    for(int r = 0; r < ans[i - j - 1].size(); r++) //大於根節點的組成方法數
                    {
                        TreeNode * root = new TreeNode(j + 1);
                        root->left = ans[j][l]; 
                        root->right = add(ans[i - j - 1][r], j + 1); //大於根節點的需要加上差值
                        ans[i].push_back(root);
                    }
                }
            }
        }

        return ans[n];
    }

    TreeNode * add(TreeNode * root, int Num)
    {
        if(root == NULL)
        {
            return root;
        }
        TreeNode * T = new TreeNode(root->val + Num);
        T->left = add(root->left, Num);
        T->right = add(root->right, Num);

        return T;
    }
};

int main()
{
    Solution s;
    vector<TreeNode *> ans = s.generateTrees(3);

    return 0;
}

 

看別人的思路，把建立子樹分為從數字start-end，直接遞迴求解，不需要像我的那樣每次還要把右子樹遍歷增加值

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<TreeNode*> generateTreesRec(int start, int end){
        vector<TreeNode*> v;
        if(start > end){
            v.push_back(NULL);
            return v;
        }
        for(int i = start; i <= end; ++i){
            vector<TreeNode*> left = generateTreesRec(start, i - 1);
            vector<TreeNode*> right = generateTreesRec(i + 1, end);
            TreeNode *node;
            for(int j = 0; j < left.size(); ++j){
                for(int k = 0; k < right.size(); ++k){
                    node = new TreeNode(i);
                    node->left = left[j];
                    node->right = right[k];
                    v.push_back(node);
                }
            }
        }
        return v;
    }
    vector<TreeNode *> generateTrees(int n) {
        return generateTreesRec(1, n);
    }
};

 

 




相關文章