Merge pull request #1925 from AkifhanIlgaz/0456

Create: 0456-132-pattern.rs / .ts / .js

Author: tahsintunan

javascript/0456-132-pattern.js

@@ -0,0 +1,22 @@
+/**
+ * @param {number[]} nums
+ * @return {boolean}
+ */
+var find132pattern = function (nums) {
+    let stack = []; // [num, minLeft]
+    let curMin = nums[0];
+
+    for (n of nums.slice(1)) {
+        while (stack.length > 0 && n >= stack.at(-1)[0]) {
+            stack.pop();
+        }
+        if (stack.length > 0 && n > stack.at(-1)[1]) {
+            return true;
+        }
+
+        stack.push([n, curMin]);
+        curMin = Math.min(curMin, n);
+    }
+
+    return false;
+};

rust/0456-132-pattern.rs

@@ -0,0 +1,20 @@
+impl Solution {
+    pub fn find132pattern(nums: Vec<i32>) -> bool {
+        let mut stack: Vec<(i32, i32)> = vec![]; // (num, min_left)
+        let mut current_min = nums[0];
+
+        for n in nums.iter().skip(1) {
+            while !stack.is_empty() && *n >= stack.last().unwrap().0 {
+                stack.pop();
+            }
+            if !stack.is_empty() && *n > stack.last().unwrap().1 {
+                return true;
+            }
+
+            stack.push((*n, current_min));
+            current_min = current_min.min(*n);
+        }
+
+        false
+    }
+}

typescript/0456-132-pattern.ts

@@ -0,0 +1,18 @@
+function find132pattern(nums: number[]): boolean {
+    let stack: { num: number; minLeft: number }[] = []; // [num, minLeft]
+    let curMin = nums[0];
+
+    for (let n of nums.slice(1)) {
+        while (stack.length > 0 && n >= stack[stack.length - 1].num) {
+            stack.pop();
+        }
+        if (stack.length > 0 && n > stack[stack.length - 1].minLeft) {
+            return true;
+        }
+
+        stack.push({ num: n, minLeft: curMin });
+        curMin = Math.min(curMin, n);
+    }
+
+    return false;
+}