feat: add solutions to lc problem: No.0962

solution/0900-0999/0962.Maximum Width Ramp/README.md

@@ -162,6 +162,96 @@ func maxWidthRamp(nums []int) int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function maxWidthRamp(nums: number[]): number {
+    let [ans, n] = [0, nums.length];
+    const stk: number[] = [];
+
+    for (let i = 0; i < n - 1; i++) {
+        if (stk.length === 0 || nums[stk.at(-1)!] > nums[i]) {
+            stk.push(i);
+        }
+    }
+
+    for (let i = n - 1; i >= 0; i--) {
+        while (stk.length && nums[stk.at(-1)!] <= nums[i]) {
+            ans = Math.max(ans, i - stk.pop()!);
+        }
+        if (stk.length === 0) break;
+    }
+
+    return ans;
+}
+```
+
+#### JavaScript
+
+```js
+function maxWidthRamp(nums) {
+    let [ans, n] = [0, nums.length];
+    const stk = [];
+
+    for (let i = 0; i < n - 1; i++) {
+        if (stk.length === 0 || nums[stk.at(-1)] > nums[i]) {
+            stk.push(i);
+        }
+    }
+
+    for (let i = n - 1; i >= 0; i--) {
+        while (stk.length && nums[stk.at(-1)] <= nums[i]) {
+            ans = Math.max(ans, i - stk.pop());
+        }
+        if (stk.length === 0) break;
+    }
+
+    return ans;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
+<!-- solution:start -->
+
+### 方法二：排序
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function maxWidthRamp(nums: number[]): number {
+    const idx = nums.map((x, i) => [x, i]).sort(([a], [b]) => a - b);
+    let [ans, j] = [0, nums.length];
+
+    for (const [_, i] of idx) {
+        ans = Math.max(ans, i - j);
+        j = Math.min(j, i);
+    }
+
+    return ans;
+}
+```
+
+#### JavaScript
+
+```js
+function maxWidthRamp(nums) {
+    const idx = nums.map((x, i) => [x, i]).sort(([a], [b]) => a - b);
+    let [ans, j] = [0, nums.length];
+
+    for (const [_, i] of idx) {
+        ans = Math.max(ans, i - j);
+        j = Math.min(j, i);
+    }
+
+    return ans;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0900-0999/0962.Maximum Width Ramp/README_EN.md

@@ -53,7 +53,7 @@ tags:
 
 <!-- solution:start -->
 
-### Solution 1
+### Solution 1: Monotonic stack
 
 <!-- tabs:start -->
 
@@ -150,6 +150,96 @@ func maxWidthRamp(nums []int) int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function maxWidthRamp(nums: number[]): number {
+    let [ans, n] = [0, nums.length];
+    const stk: number[] = [];
+
+    for (let i = 0; i < n - 1; i++) {
+        if (stk.length === 0 || nums[stk.at(-1)!] > nums[i]) {
+            stk.push(i);
+        }
+    }
+
+    for (let i = n - 1; i >= 0; i--) {
+        while (stk.length && nums[stk.at(-1)!] <= nums[i]) {
+            ans = Math.max(ans, i - stk.pop()!);
+        }
+        if (stk.length === 0) break;
+    }
+
+    return ans;
+}
+```
+
+#### JavaScript
+
+```js
+function maxWidthRamp(nums) {
+    let [ans, n] = [0, nums.length];
+    const stk = [];
+
+    for (let i = 0; i < n - 1; i++) {
+        if (stk.length === 0 || nums[stk.at(-1)] > nums[i]) {
+            stk.push(i);
+        }
+    }
+
+    for (let i = n - 1; i >= 0; i--) {
+        while (stk.length && nums[stk.at(-1)] <= nums[i]) {
+            ans = Math.max(ans, i - stk.pop());
+        }
+        if (stk.length === 0) break;
+    }
+
+    return ans;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
+<!-- solution:start -->
+
+### Solution 2: Sorting
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function maxWidthRamp(nums: number[]): number {
+    const idx = nums.map((x, i) => [x, i]).sort(([a], [b]) => a - b);
+    let [ans, j] = [0, nums.length];
+
+    for (const [_, i] of idx) {
+        ans = Math.max(ans, i - j);
+        j = Math.min(j, i);
+    }
+
+    return ans;
+}
+```
+
+#### JavaScript
+
+```js
+function maxWidthRamp(nums) {
+    const idx = nums.map((x, i) => [x, i]).sort(([a], [b]) => a - b);
+    let [ans, j] = [0, nums.length];
+
+    for (const [_, i] of idx) {
+        ans = Math.max(ans, i - j);
+        j = Math.min(j, i);
+    }
+
+    return ans;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0900-0999/0962.Maximum Width Ramp/Solution.js

@@ -0,0 +1,19 @@
+function maxWidthRamp(nums) {
+    let [ans, n] = [0, nums.length];
+    const stk = [];
+
+    for (let i = 0; i < n - 1; i++) {
+        if (stk.length === 0 || nums[stk.at(-1)] > nums[i]) {
+            stk.push(i);
+        }
+    }
+
+    for (let i = n - 1; i >= 0; i--) {
+        while (stk.length && nums[stk.at(-1)] <= nums[i]) {
+            ans = Math.max(ans, i - stk.pop());
+        }
+        if (stk.length === 0) break;
+    }
+
+    return ans;
+}

solution/0900-0999/0962.Maximum Width Ramp/Solution.ts

@@ -0,0 +1,19 @@
+function maxWidthRamp(nums: number[]): number {
+    let [ans, n] = [0, nums.length];
+    const stk: number[] = [];
+
+    for (let i = 0; i < n - 1; i++) {
+        if (stk.length === 0 || nums[stk.at(-1)!] > nums[i]) {
+            stk.push(i);
+        }
+    }
+
+    for (let i = n - 1; i >= 0; i--) {
+        while (stk.length && nums[stk.at(-1)!] <= nums[i]) {
+            ans = Math.max(ans, i - stk.pop()!);
+        }
+        if (stk.length === 0) break;
+    }
+
+    return ans;
+}

solution/0900-0999/0962.Maximum Width Ramp/Solution2.js

@@ -0,0 +1,11 @@
+function maxWidthRamp(nums) {
+    const idx = nums.map((x, i) => [x, i]).sort(([a], [b]) => a - b);
+    let [ans, j] = [0, nums.length];
+
+    for (const [_, i] of idx) {
+        ans = Math.max(ans, i - j);
+        j = Math.min(j, i);
+    }
+
+    return ans;
+}

solution/0900-0999/0962.Maximum Width Ramp/Solution2.ts

@@ -0,0 +1,11 @@
+function maxWidthRamp(nums: number[]): number {
+    const idx = nums.map((x, i) => [x, i]).sort(([a], [b]) => a - b);
+    let [ans, j] = [0, nums.length];
+
+    for (const [_, i] of idx) {
+        ans = Math.max(ans, i - j);
+        j = Math.min(j, i);
+    }
+
+    return ans;
+}