→ Smallsh: 大師 08/12 20:07
推 dont: 大師 08/13 15:25
懶得寫今天的，挑一個 binary tree
654. Maximum Binary Tree
寫一寫根本就變成練習 C++ container
class Solution {
public:
TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
TreeNode* root = nullptr;
constructMaximumBinaryTree(root, nums.begin(), nums.end());
return root;
}
private:
static void constructMaximumBinaryTree(TreeNode*& root,
vector<int>::iterator start,
vector<int>::iterator end) {
if (start == end) {
return;
}
vector<int>::iterator maxIter = max_element(start, end);
root = new TreeNode(*maxIter);
constructMaximumBinaryTree(root->left, start, maxIter);
constructMaximumBinaryTree(root->right, next(maxIter, 1), end);
}
};
--
https://i.imgur.com/07Uv9NC.png https://i.imgur.com/YNJpGoH.png
https://i.imgur.com/G69mH5A.png https://i.imgur.com/ptaX5iW.png
https://i.imgur.com/hEeZuph.png https://i.imgur.com/mGTKAFz.png
https://i.imgur.com/gdejDOy.png https://i.imgur.com/JX7AHZc.png
https://i.imgur.com/X6Pgqgi.png https://i.imgur.com/mJ8dU86.png
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 125.228.71.204 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1723464456.A.4D2.html