0998 added.

liuyubobobo · liuyubobobo · commit f18c98e3bc4a · 2019-03-11T00:39:55.000-07:00
diff --git a/0998-Maximum-Binary-Tree-II/cpp-0998/CMakeLists.txt b/0998-Maximum-Binary-Tree-II/cpp-0998/CMakeLists.txt
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.13)
+project(C)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(C main.cpp)
diff --git a/0998-Maximum-Binary-Tree-II/cpp-0998/main.cpp b/0998-Maximum-Binary-Tree-II/cpp-0998/main.cpp
@@ -0,0 +1,61 @@
+/// Source : https://leetcode.com/problems/maximum-binary-tree-ii/
+/// Author : liuyubobobo
+/// Time   : 2019-02-23
+
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+
+/// Definition for a binary tree node.
+struct TreeNode {
+    int val;
+    TreeNode *left;
+    TreeNode *right;
+    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+};
+
+
+/// Simulation
+/// Time Complexity: O(n^2)
+/// Space Complexity: O(n)
+class Solution {
+public:
+    TreeNode* insertIntoMaxTree(TreeNode* root, int val) {
+
+        vector<int> A;
+        dfs(root, A);
+        A.push_back(val);
+        return construct(A, 0, A.size() - 1);
+    }
+
+private:
+    TreeNode* construct(const vector<int>& A, int l, int r){
+
+        if(l > r) return NULL;
+
+        int best_val = A[l], best_index = l;
+        for(int i = l + 1; i <= r; i ++)
+            if(A[i] > best_val)
+                best_val = A[i], best_index = i;
+
+        TreeNode* retNode = new TreeNode(A[best_index]);
+        retNode->left = construct(A, l, best_index - 1);
+        retNode->right = construct(A, best_index + 1, r);
+        return retNode;
+    }
+
+    void dfs(TreeNode* root, vector<int>& A){
+
+        if(!root) return;
+        dfs(root->left, A);
+        A.push_back(root->val);
+        dfs(root->right, A);
+    }
+};
+
+int main() {
+
+    return 0;
+}
diff --git a/readme.md b/readme.md
@@ -666,6 +666,7 @@ email: [liuyubobobo@gmail.com](mailto:liuyubobobo@gmail.com)
 | 995 | [Minimum Number of K Consecutive Bit Flips](https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips/) | [solution](https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips/solution/) | [C++](0995-Minimum-Number-of-K-Consecutive-Bit-Flips/cpp-0995/) | | |
 | 996 | [Number of Squareful Arrays](https://leetcode.com/problems/number-of-squareful-arrays/) | [solution](https://leetcode.com/problems/number-of-squareful-arrays/solution/) | [C++](0996-Number-of-Squareful-Arrays/cpp-0996/) | | |
 | 997 | [Find the Town Judge](https://leetcode.com/problems/find-the-town-judge/) | [无] | [C++](0997-Find-the-Town-Judge/cpp-0997/) | | |
+| 998 | [Maximum Binary Tree II](https://leetcode.com/problems/maximum-binary-tree-ii/) | [无] | [C++](0998-Maximum-Binary-Tree-II/cpp-0998/) | | |
 | | | | | | |
 | 1000 | [Minimum Cost to Merge Stones](https://leetcode.com/problems/minimum-cost-to-merge-stones/) | [无] | [C++](1000-Minimum-Cost-to-Merge-Stones/cpp-1000/) | | |
 | | | | | | |
