💯 [11] a1 - I SOLVED IT! - Runtime 74 ms Beats 71.39% Memory 49.1 MB Beats 95.23%

Author: enkr1

11/my_solution.js

@@ -0,0 +1,32 @@
+/**
+ * @param {number[]} height
+ * @return {number}
+*/
+const maxArea = (nums) => {
+  let l = 0, r = nums.length - 1, maxArea = 0;
+
+  while (l < r) {
+    console.log(`__________ l:${l}, r:${r}, min:${Math.min(nums[l], nums[r])}`)
+    let area = ((r - l) * Math.min(nums[l], nums[r]));
+    console.log("area")
+    console.log(area)
+    maxArea = Math.max(area, maxArea);
+    console.log("maxArea")
+    console.log(maxArea)
+
+    if (nums[l] >= nums[r]) {
+      r--;
+    } else {
+      l++;
+    }
+  }
+
+  console.log("maxArea")
+  console.log(maxArea)
+
+  return maxArea;
+}
+
+// maxArea([1, 8, 6, 2, 5, 4, 8, 3, 7])
+maxArea([1, 1])
+maxArea([1, 201, 3, 400, 30, 30, 1394])

11/solution.js

@@ -0,0 +1,20 @@
+/**
+ * @param {number[]} height
+ * @return {number}
+*/
+const maxArea = (nums) => {
+  let l = 0, r = nums.length - 1, maxArea = 0;
+
+  while (l < r) {
+    let area = ((r - l) * Math.min(nums[l], nums[r]));
+    maxArea = Math.max(area, maxArea);
+
+    if (nums[l] >= nums[r]) {
+      r--;
+    } else {
+      l++;
+    }
+  }
+
+  return maxArea;
+}