【Leetcode】maximum binary tree

Given an integer array with no duplicates. A maximum tree building on this array is defined as follow:

1. The root is the maximum number in the array.
2. The left subtree is the maximum tree constructed from left part subarray divided by the maximum number.
3. The right subtree is the maximum tree constructed from right part subarray divided by the maximum number.

 

Construct the maximum tree by the given array and output the root node of this tree.

Example 1:

Input: [3,2,1,6,0,5]
Output: return the tree root node representing the following tree:

      6
    /   \
   3     5
    \    / 
     2  0   
       \
        1

题目大意：每次先找到数组中的最大值，将其作为根节点，然后再寻找其左右子树；其中这个节点所在的数组的左边为其左孩子，其右边为右孩子

解题思路：

①当栈root为空时，节点add直接入栈。进入下一循环

②当栈不为空时，比较当前节点add与栈顶节点root.back()的val大小

 如果root.back的val小于当前节点add，说明add的left可能指向root.back；将root.back弹出栈，比较下一个元素，直到栈为空或者栈顶元素的val大于add，则将root.back的右节点指向add；最后将当前节点add入栈

③最终树根节点会在栈低，用root.front()返回

class Solution {
public:
    TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
       vector<TreeNode*> root;
	for (int i = 0; i < nums.size(); i++) {
	    TreeNode* add = new TreeNode(nums[i]);
	    if (root.empty()) {
		root.push_back(add);
	    } else {
            while (!root.empty() && root.back()->val < nums[i]) {
		    add->left = root.back();
		    root.pop_back();
		}
		if (!root.empty()) root.back()->right = add;
		root.push_back(add);
	    }
	}
	return root.front();
    }
};