zoukankan      html  css  js  c++  java
  • [leetcode-654-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
    

    Note:

    1. The size of the given array will be in the range [1,1000].

    思路:

    用一个map来存储对应的数值和下标,正好利用map里面值是有序的特性,map里面最后一个值即为最大值。然后递归构造左子树和右子树。

    TreeNode* maxtree(vector<int>& nums,int left,int right)
    {
      if(left>right || nums.size()==0 || left<0 || right>=nums.size())return NULL;
      map<int,int>mp;
      for(int i=left;i<=right;i++)mp[nums[i]] =i;
      auto it = mp.rbegin();
      int maxnum = it->first;
      TreeNode* root = new TreeNode(maxnum);
      
       TreeNode* leftT = maxtree(nums,left,it->second -1);
       TreeNode* rightT = maxtree(nums,it->second +1,right);
       root->left = leftT,root->right =rightT;
      return root;
    }
    TreeNode* constructMaximumBinaryTree(vector<int>& nums)
    {
       return maxtree(nums,0,nums.size()-1);
    }
  • 相关阅读:
    数据库查询(二)
    数据库插入操作
    java关键字查询数据库
    登录页面设计
    获取下拉列表的值
    Linux下tomcat 8安装与配置
    CentOS7下防火墙的设置
    centos 7 下nginx的安装
    vmware14下centos 7的安装和配置
    Linux中JDK的安装以及配置
  • 原文地址:https://www.cnblogs.com/hellowooorld/p/7294195.html
Copyright © 2011-2022 走看看