leetcode654
发布时间:2020-12-14 04:19:58 所属栏目:大数据 来源:网络整理
导读:class Solution { public : TreeNode * constructMaximumBinaryTree(vector int nums) { if (nums.size() == 0 ) return NULL; else if (nums.size() == 1 ) { TreeNode * node = new TreeNode(nums[ 0 ]); return node; } else { int max = 0 ; for ( int i
class Solution { public: TreeNode* constructMaximumBinaryTree(vector<int>& nums) { if (nums.size() == 0) return NULL; else if (nums.size() == 1) { TreeNode * node = new TreeNode(nums[0]); return node; } else { int max = 0; for (int i = 0; i<nums.size(); i++) { if (nums[i]>nums[max]) max = i; } vector<int> left_num,right_num; for (int i = 0; i<max; i++) { left_num.push_back(nums[i]); } for (int j = max + 1; j<nums.size(); j++) { right_num.push_back(nums[j]); } TreeNode * node = new TreeNode(nums[max]); node->left = constructMaximumBinaryTree(left_num); node->right = constructMaximumBinaryTree(right_num); return node; } } }; (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |