Merge pull request neetcode-gh#361 from Chrislee1996/main

Created 235-lowest-common-ancestor-of-a-BST and 66-Plus-One for Javascript

Author: neetcode-gh

javascript/235-lowest-common-ancestor-of-a-binary-search-tree.js

@@ -0,0 +1,25 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+
+/**
+ * @param {TreeNode} root
+ * @param {TreeNode} p
+ * @param {TreeNode} q
+ * @return {TreeNode}
+ */
+ var lowestCommonAncestor = function(root, p, q) {
+    while(root !== null) {
+        if (root.val < p.val && root.val < q.val ) {
+            root = root.right
+        } else if (root.val > p.val && root.val > q.val) {
+            root = root.left
+        } else {
+            return root
+        }
+    }
+};

javascript/66-plus-one.js

@@ -0,0 +1,16 @@
+/**
+ * @param {number[]} digits
+ * @return {number[]}
+ */
+ var plusOne = function(digits) {
+    for (let i = digits.length-1 ; i >= 0 ; i--) {
+        if (digits[i] !== 9) {
+            digits[i]++
+            return digits
+        } else {
+            digits[i] = 0
+        }
+    }
+    digits.unshift(1)
+    return digits
+};