一道题构建二叉树编译不同的思考

最新推荐文章于 2021-07-22 14:14:25 发布

hiphopmattshi

最新推荐文章于 2021-07-22 14:14:25 发布

阅读量1.3k

点赞数

分类专栏：算法学习

本文链接：https://blog.csdn.net/hiphopmattshi/article/details/52276765

版权

算法学习专栏收录该内容

104 篇文章 1 订阅

订阅专栏

</pre><pre name="code" class="cpp">

TreeNode *buildTree(vector<int> &preorder, vector<int> &inorder) {
        //return Helper(preorder, 0, preorder.size()-1, inorder, 0, inorder.size()-1);
        return buildTreeMy(preorder, inorder, 0, preorder.size() - 1, 0, inorder.size() - 1);
    }
 TreeNode* buildTreeMy(vector<int>& preorder, vector<int>& inorder, int startPre, int endPre, int startIno, int endIno)
{
	TreeNode* root = new TreeNode(preorder[startPre]);
	int i = 0;
	int leftLength = 0;
	int rightLength = 0;
	if(startPre > endPre)
	    return NULL;
	if (startPre == endPre)
	{
		return root;	
	
	}
	int val = preorder[startPre]; // root value
	for (i = startIno; i <= endIno; i++)
	{
		if (inorder[i] == val)
		{
			leftLength = i - startIno;
			break;
		}
	}

	if (leftLength >0)
	{
		root->left = buildTreeMy(preorder, inorder, startPre + 1, startPre + leftLength, startIno, startIno + leftLength - 1);
	}
	rightLength = endPre - startPre - leftLength;
	if (rightLength>0)
	{
		root->right = buildTreeMy(preorder, inorder, startPre + leftLength + 1, endPre, startIno + leftLength + 1, endIno);
	}
	return root;
    }

</pre><p>以上这段代码在LeeCODE上运行显示超时</p><p><pre name="code" class="cpp">TreeNode* buildTreeMy(vector<int>& preorder, vector<int>& inorder, int startPre, int endPre, int startIno, int endIno)
{

	int i = 0;
	int leftLength = 0;
	int rightLength = 0;
	if(startPre > endPre)
	    return NULL;
	if (startPre == endPre)
	{

			return  new TreeNode(preorder[startPre]);
	
	}
        TreeNode* root = new TreeNode(preorder[startPre]);
	int val = preorder[startPre]; // root value
	for (i = startIno; i <= endIno; i++)
	{
		if (inorder[i] == val)
		{
			leftLength = i - startIno;
			break;
		}
	}

	if (leftLength >0)
	{
		root->left = buildTreeMy(preorder, inorder, startPre + 1, startPre + leftLength, startIno, startIno + leftLength - 1);
	}
	rightLength = endPre - startPre - leftLength;
	if (rightLength>0)
	{
		root->right = buildTreeMy(preorder, inorder, startPre + leftLength + 1, endPre, startIno + leftLength + 1, endIno);
	}
	return root;
    }

采用该代码正常提交。

没想明白什么原因。