feat: add solutions to lcof problem: No.31

面试题31. 栈的压入、弹出序列

Author: YangFong

lcof/面试题31. 栈的压入、弹出序列/README.md

@@ -124,6 +124,42 @@ public:
 };
 ```
 
+### **TypeScript**
+
+```ts
+function validateStackSequences(pushed: number[], popped: number[]): boolean {
+    const stack = [];
+    let i = 0;
+    for (const num of pushed) {
+        stack.push(num);
+        while (stack.length !== 0 && stack[stack.length - 1] === popped[i]) {
+            stack.pop();
+            i++;
+        }
+    }
+    return stack.length === 0;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn validate_stack_sequences(pushed: Vec<i32>, popped: Vec<i32>) -> bool {
+        let mut stack = Vec::new();
+        let mut i = 0;
+        for &num in pushed.iter() {
+            stack.push(num);
+            while !stack.is_empty() && *stack.last().unwrap() == popped[i] {
+                stack.pop();
+                i += 1;
+            }
+        }
+        stack.len() == 0
+    }
+}
+```
+
 ### **...**
 
 ```

lcof/面试题31. 栈的压入、弹出序列/Solution.rs

@@ -0,0 +1,14 @@
+impl Solution {
+    pub fn validate_stack_sequences(pushed: Vec<i32>, popped: Vec<i32>) -> bool {
+        let mut stack = Vec::new();
+        let mut i = 0;
+        for &num in pushed.iter() {
+            stack.push(num);
+            while !stack.is_empty() && *stack.last().unwrap() == popped[i] {
+                stack.pop();
+                i += 1;
+            }
+        }
+        stack.len() == 0
+    }
+}

lcof/面试题31. 栈的压入、弹出序列/Solution.ts

@@ -0,0 +1,12 @@
+function validateStackSequences(pushed: number[], popped: number[]): boolean {
+    const stack = [];
+    let i = 0;
+    for (const num of pushed) {
+        stack.push(num);
+        while (stack.length !== 0 && stack[stack.length - 1] === popped[i]) {
+            stack.pop();
+            i++;
+        }
+    }
+    return stack.length === 0;
+}