leetcode unique binary search tree - 2

unique binary search tree

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

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

confused what"{1,#,2,3}"means? > read more on how binary tree is serialized on OJ.

OJ’s Binary Tree Serialization:
The serialization of a binary tree follows a level order traversal, where ‘#’ signifies a path terminator where no node exists below.
Here’s an example:
1
/
2 3
/
4

5
The above binary tree is serialized as"{1,2,3,#,#,4,#,#,5}".

/**

• 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) 
    {
        if (0 == n)
            return vector<TreeNode *>(1, NULL);
        return maketree(1,n);
    }
    vector<TreeNode *> maketree(int start, int end)
    {
        pair<int, int> pairtmp (start, end);
        if (mmap.find(pairtmp)  != mmap.end())
        //虽然通过  但是这里有问题   比如两个结果中都有一颗子树是234，则这两个子树的根节点是同一个地址
        //每个单独节点的值都是同一个
            return mmap[pairtmp];
        vector<TreeNode *> res;
        if (start == end)
        {
            TreeNode * tmp = new TreeNode(start);
            res.push_back(tmp);
            //return res;
        }
        else if (start<end)
        {
            for (int i=start; i<=end; i++)
            {
                vector<TreeNode *> vecleft = maketree(start, i-1);
                vector<TreeNode *> vecright= maketree(i+1, end);
                if (vecleft.size() == 0 && vecright.size() != 0)
                {
                    for (int k=0;k<vecright.size();k++)
                    {
                        TreeNode * tmp = new TreeNode (i);
                        tmp->right = vecright[k];
                        res.push_back(tmp);
                    }
                }
                else if (vecleft.size() != 0 && vecright.size() == 0)
                {
                    for (int k=0;k<vecleft.size();k++)
                    {
                        TreeNode * tmp = new TreeNode (i);
                        tmp->left = vecleft[k];
                        res.push_back(tmp);
                    }
                }
                else if (vecleft.size() != 0 && vecright.size() != 0)
                {
                    for (int j=0;j<vecleft.size();j++)
                    {
                        for (int k=0;k<vecright.size();k++)
                        {
                            TreeNode * tmp = new TreeNode (i);
                            tmp->left = vecleft[j];
                            tmp->right = vecright[k];
                            res.push_back(tmp);
                        }
                    }
                }
                else
                {
                    TreeNode * tmp = new TreeNode (i);
                    res.push_back(tmp);
                }
               
            }
        }
        mmap.insert(pair<pair<int,int>, vector<TreeNode *>  >(pairtmp, res));
        return res;
    }
    map<pair<int,int>, vector<TreeNode *> > mmap;
};


//待优化    123  456应该属于同一类，只不过起始大小不同，不需要计算多次

测试

#include "head.h"

class Solution {
public:
    vector<TreeNode *> generateTrees(int n) 
    {
        if (0 == n)
            return vector<TreeNode *>(1, NULL);
        return maketree(1,n);
    }
    vector<TreeNode *> maketree(int start, int end)
    {
        cout<<start<<" "<<end<<endl;
        pair<int, int> pairtmp (start, end);
        if (mmap.find(pairtmp)  != mmap.end())
            return mmap[pairtmp];
        vector<TreeNode *> res;
        if (start == end)
        {
            TreeNode * tmp = new TreeNode(start);
            res.push_back(tmp);
            //return res;
        }
        else if (start<end)
        {
            for (int i=start; i<=end; i++)
            {
                vector<TreeNode *> vecleft = maketree(start, i-1);
                vector<TreeNode *> vecright= maketree(i+1, end);
                if (vecleft.size() == 0 && vecright.size() != 0)
                {
                    for (int k=0;k<vecright.size();k++)
                    {
                        TreeNode * tmp = new TreeNode (i);
                        tmp->right = vecright[k];
                        res.push_back(tmp);
                    }
                }
                else if (vecleft.size() != 0 && vecright.size() == 0)
                {
                    for (int k=0;k<vecleft.size();k++)
                    {
                        TreeNode * tmp = new TreeNode (i);
                        tmp->left = vecleft[k];
                        res.push_back(tmp);
                    }
                }
                else if (vecleft.size() != 0 && vecright.size() != 0)
                {
                    for (int j=0;j<vecleft.size();j++)
                    {
                        for (int k=0;k<vecright.size();k++)
                        {
                            TreeNode * tmp = new TreeNode (i);
                            tmp->left = vecleft[j];
                            tmp->right = vecright[k];
                            res.push_back(tmp);
                        }
                    }
                }
                else
                {
                    TreeNode * tmp = new TreeNode (i);
                    res.push_back(tmp);
                }
               
            }
        }
        mmap.insert(pair<pair<int,int>, vector<TreeNode *>  >(pairtmp, res));
        return res;
    }
    map<pair<int,int>, vector<TreeNode *> > mmap;
};

    
//比较时间
int main()
{   
    Solution s;
    vector<TreeNode *> res = s.generateTrees(5);
    cout<<res.size()<<endl;
    for (int i=0;i<res.size();i++)
    {
        Firstordernotloop(res[i]);
        cout<<endl;
    }
    return 0;
}