add 1382

Author: luliyucoordinate

README.md

@@ -672,4 +672,5 @@ LeetCode
 |1376|[Time Needed to Inform All Employees](https://leetcode.com/problems/time-needed-to-inform-all-employees/)|c|[c++](./src/1376-Time-Needed-to-Inform-All-Employees/1376.cpp)|[python](./src/1376-Time-Needed-to-Inform-All-Employees/1376.py)|[go](./src/1376-Time-Needed-to-Inform-All-Employees/1376.go)|[js](./src/1376-Time-Needed-to-Inform-All-Employees/1376.js)|[java](./src/1376-Time-Needed-to-Inform-All-Employees/1376.java)|Medium|
 |1377|[Frog Position After T Seconds](https://leetcode.com/problems/frog-position-after-t-seconds/)|c|[c++](./src/1377-Frog-Position-After-T-Seconds/1377.cpp)|[python](./src/1377-Frog-Position-After-T-Seconds/1377.py)|[go](./src/1377-Frog-Position-After-T-Seconds/1377.go)|[js](./src/1377-Frog-Position-After-T-Seconds/1377.js)|[java](./src/1377-Frog-Position-After-T-Seconds/1377.java)|Hard|
 |1380|[Lucky Numbers in a Matrix](https://leetcode.com/problems/lucky-numbers-in-a-matrix/)|c|[c++](./src/1380-Lucky-Numbers-in-a-Matrix/1380.cpp)|[python](./src/1380-Lucky-Numbers-in-a-Matrix/1380.py)|[go](./src/1380-Lucky-Numbers-in-a-Matrix/1380.go)|[js](./src/1380-Lucky-Numbers-in-a-Matrix/1380.js)|[java](./src/1380-Lucky-Numbers-in-a-Matrix/1380.java)|Easy|
-|1381|[Design a Stack With Increment Operation](https://leetcode.com/problems/design-a-stack-with-increment-operation/)|c|[c++](./src/1381-Design-a-Stack-With-Increment-Operation/1381.cpp)|[python](./src/1381-Design-a-Stack-With-Increment-Operation/1381.py)|[go](./src/1381-Design-a-Stack-With-Increment-Operation/1381.go)|[js](./src/1381-Design-a-Stack-With-Increment-Operation/1381.js)|[java](./src/1381-Design-a-Stack-With-Increment-Operation/1381.java)|Medium|
+|1381|[Design a Stack With Increment Operation](https://leetcode.com/problems/design-a-stack-with-increment-operation/)|c|[c++](./src/1381-Design-a-Stack-With-Increment-Operation/1381.cpp)|[python](./src/1381-Design-a-Stack-With-Increment-Operation/1381.py)|[go](./src/1381-Design-a-Stack-With-Increment-Operation/1381.go)|[js](./src/1381-Design-a-Stack-With-Increment-Operation/1381.js)|[java](./src/1381-Design-a-Stack-With-Increment-Operation/1381.java)|Medium|
+|1382|[Balance a Binary Search Tree](https://leetcode.com/problems/balance-a-binary-search-tree/)|c|[c++](./src/1382-Balance-a-Binary-Search-Tree/1382.cpp)|[python](./src/1382-Balance-a-Binary-Search-Tree/1382.py)|[go](./src/1382-Balance-a-Binary-Search-Tree/1382.go)|[js](./src/1382-Balance-a-Binary-Search-Tree/1382.js)|[java](./src/1382-Balance-a-Binary-Search-Tree/1382.java)|Medium|

src/1382-Balance-a-Binary-Search-Tree/1382.cpp

@@ -0,0 +1,27 @@
+class Solution {
+public:
+    TreeNode* balanceBST(TreeNode* root) {
+        inOrder(root);
+        return sortedToBST(0, res.size() - 1);
+    }
+    
+private:
+    vector<int> res;
+    
+    void inOrder(TreeNode* root) {
+        if (root != nullptr) {
+            inOrder(root->left);
+            res.emplace_back(root->val);
+            inOrder(root->right);
+        }
+    }
+    
+    TreeNode* sortedToBST(int l, int r) {
+        if (l > r) return nullptr;
+        int mid = (l + r) >> 1;
+        TreeNode* root = new TreeNode(res[mid]);
+        root->left = sortedToBST(l, mid - 1);
+        root->right = sortedToBST(mid + 1, r);
+        return root;
+    }
+};

src/1382-Balance-a-Binary-Search-Tree/1382.go

@@ -0,0 +1,28 @@
+var res []int
+
+func balanceBST(root *TreeNode) *TreeNode {
+    res = []int{}
+    inOrder(root)
+    return sortedToBST(0, len(res) - 1)
+}
+
+func inOrder(root *TreeNode) {
+    if root != nil {
+        inOrder(root.Left)
+        res = append(res, root.Val)
+        inOrder(root.Right)
+    }
+}
+
+func sortedToBST(l, r int) *TreeNode {
+    if l > r {
+        return nil
+    }
+    
+    mid := (l + r) >> 1
+    root := new(TreeNode)
+    root.Val = res[mid]
+    root.Left = sortedToBST(l, mid - 1)
+    root.Right = sortedToBST(mid + 1, r)
+    return root
+}

src/1382-Balance-a-Binary-Search-Tree/1382.java

@@ -0,0 +1,25 @@
+class Solution {
+    public TreeNode balanceBST(TreeNode root) {
+        inOrder(root);
+        return sortedToBST(0, res.size() - 1);
+    }
+    
+    private List<Integer> res = new ArrayList();
+    
+    private void inOrder(TreeNode root) {
+        if (root != null) {
+            inOrder(root.left);
+            res.add(root.val);
+            inOrder(root.right);
+        }
+    }
+    
+    private TreeNode sortedToBST(int l, int r) {
+        if (l > r) return  null;
+        int mid = (l + r) >> 1;
+        TreeNode root = new TreeNode(res.get(mid));
+        root.left = sortedToBST(l, mid - 1);
+        root.right = sortedToBST(mid + 1, r);
+        return root;
+    }
+}

src/1382-Balance-a-Binary-Search-Tree/1382.js

@@ -0,0 +1,22 @@
+var balanceBST = function(root) {
+    let res = [];
+    let inOrder = function(root) {
+        if (root != null) {
+            inOrder(root.left);
+            res.push(root.val);
+            inOrder(root.right);
+        }
+    }
+    
+    inOrder(root);
+    
+    let sortedToBST = function(l, r) {
+        if (l > r) return  null;
+        let mid = (l + r) >> 1;
+        let root = new TreeNode(res[mid]);
+        root.left = sortedToBST(l, mid - 1);
+        root.right = sortedToBST(mid + 1, r);
+        return root;
+    }
+    return sortedToBST(0, res.length - 1);  
+};

src/1382-Balance-a-Binary-Search-Tree/1382.py

@@ -0,0 +1,20 @@
+class Solution:
+    def balanceBST(self, root: TreeNode) -> TreeNode:
+        res = []
+        def inOrder(node):
+            if node:
+                inOrder(node.left)
+                res.append(node.val)
+                inOrder(node.right)
+        
+        inOrder(root)
+        
+        def sortedToBST(l, r):
+            if l > r: return None
+            mid = (l + r) >> 1
+            root = TreeNode(res[mid])
+            root.left = sortedToBST(l, mid - 1)
+            root.right = sortedToBST(mid + 1, r)
+            return root
+        
+        return sortedToBST(0, len(res)-1)

src/addProb.py

@@ -2,9 +2,9 @@
 import os, bisect
 
 # 题目名称
-name = "Design a Stack With Increment Operation"
-ID = 1381
-url = "https://leetcode.com/problems/design-a-stack-with-increment-operation/"
+name = "Balance a Binary Search Tree"
+ID = 1382
+url = "https://leetcode.com/problems/balance-a-binary-search-tree/"
 difficult = "Medium"
 prog = ['c', 'cpp', 'py', 'go', 'js', 'java']