feat: update solutions to lc problems: No.0029,0285

No.0029.Divide Two Integers
No.0285.Inorder Successor in BST

Author: yanglbme

solution/0000-0099/0029.Divide Two Integers/README.md

@@ -89,8 +89,8 @@ class Solution {
         if ((a < 0) != (b < 0)) {
             sign = -1;
         }
-        long x = abs(a);
-        long y = abs(b);
+        long x = Math.abs((long) a);
+        long y = Math.abs((long) b);
         long tot = 0;
         while (x >= y) {
             int cnt = 0;
@@ -106,13 +106,6 @@ class Solution {
         }
         return Integer.MAX_VALUE;
     }
-
-    private long abs(long a) {
-        if (a < 0) {
-            return -a;
-        }
-        return a;
-    }
 }
 ```
 

solution/0000-0099/0029.Divide Two Integers/README_EN.md

@@ -85,8 +85,8 @@ class Solution {
         if ((a < 0) != (b < 0)) {
             sign = -1;
         }
-        long x = abs(a);
-        long y = abs(b);
+        long x = Math.abs((long) a);
+        long y = Math.abs((long) b);
         long tot = 0;
         while (x >= y) {
             int cnt = 0;
@@ -102,13 +102,6 @@ class Solution {
         }
         return Integer.MAX_VALUE;
     }
-
-    private long abs(long a) {
-        if (a < 0) {
-            return -a;
-        }
-        return a;
-    }
 }
 ```
 

solution/0000-0099/0029.Divide Two Integers/Solution.java

@@ -4,8 +4,8 @@ public int divide(int a, int b) {
         if ((a < 0) != (b < 0)) {
             sign = -1;
         }
-        long x = abs(a);
-        long y = abs(b);
+        long x = Math.abs((long) a);
+        long y = Math.abs((long) b);
         long tot = 0;
         while (x >= y) {
             int cnt = 0;
@@ -21,11 +21,4 @@ public int divide(int a, int b) {
         }
         return Integer.MAX_VALUE;
     }
-
-    private long abs(long a) {
-        if (a < 0) {
-            return -a;
-        }
-        return a;
-    }
-}
+}

solution/0200-0299/0285.Inorder Successor in BST/README.md

@@ -174,34 +174,18 @@ public:
  * @param {TreeNode} p
  * @return {TreeNode}
  */
-var inorderSuccessor = function (root, p) {
-    function findMin(root) {
-        if (!root) {
-            return null;
-        }
-        while (root.left) {
-            root = root.left;
-        }
-        return root;
-    }
-    if (!root) {
-        return null;
-    }
-    let successor = null;
-    while (root) {
-        if (root.val > p.val) {
-            successor = root;
-            root = root.left;
-        } else if (root.val < p.val) {
-            root = root.right;
+var inorderSuccessor = function(root, p) {
+    let cur = root;
+    let ans = null;
+    while (cur != null) {
+        if (cur.val <= p.val) {
+            cur = cur.right;
         } else {
-            if (root.right) {
-                successor = findMin(root.right);
-            }
-            break;
+            ans = cur;
+            cur = cur.left;
         }
     }
-    return successor;
+    return ans;
 };
 ```
 

solution/0200-0299/0285.Inorder Successor in BST/README_EN.md

@@ -158,34 +158,18 @@ public:
  * @param {TreeNode} p
  * @return {TreeNode}
  */
-var inorderSuccessor = function (root, p) {
-    function findMin(root) {
-        if (!root) {
-            return null;
-        }
-        while (root.left) {
-            root = root.left;
-        }
-        return root;
-    }
-    if (!root) {
-        return null;
-    }
-    let successor = null;
-    while (root) {
-        if (root.val > p.val) {
-            successor = root;
-            root = root.left;
-        } else if (root.val < p.val) {
-            root = root.right;
+var inorderSuccessor = function(root, p) {
+    let cur = root;
+    let ans = null;
+    while (cur != null) {
+        if (cur.val <= p.val) {
+            cur = cur.right;
         } else {
-            if (root.right) {
-                successor = findMin(root.right);
-            }
-            break;
+            ans = cur;
+            cur = cur.left;
         }
     }
-    return successor;
+    return ans;
 };
 ```
 

solution/0200-0299/0285.Inorder Successor in BST/Solution.js

@@ -10,32 +10,16 @@
  * @param {TreeNode} p
  * @return {TreeNode}
  */
-var inorderSuccessor = function (root, p) {
-	function findMin(root) {
-		if (!root) {
-			return null;
-		}
-		while (root.left) {
-			root = root.left;
-		}
-		return root;
-	}
-	if (!root) {
-		return null;
-	}
-	let successor = null;
-	while (root) {
-		if (root.val > p.val) {
-			successor = root;
-			root = root.left;
-		} else if (root.val < p.val) {
-			root = root.right;
-		} else {
-			if (root.right) {
-				successor = findMin(root.right);
-			}
-			break;
-		}
-	}
-	return successor;
+ var inorderSuccessor = function(root, p) {
+    let cur = root;
+    let ans = null;
+    while (cur != null) {
+        if (cur.val <= p.val) {
+            cur = cur.right;
+        } else {
+            ans = cur;
+            cur = cur.left;
+        }
+    }
+    return ans;
 };