feat: update solutions to leetcode problem: No.0456

Author: yanglbme

solution/0400-0499/0456.132 Pattern/README.md

@@ -43,22 +43,49 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+单调栈实现。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def find132pattern(self, nums: List[int]) -> bool:
+        ak = float('-inf')
+        stack = []
+        for num in nums[::-1]:
+            if num < ak:
+                return True
+            while stack and num > stack[-1]:
+                ak = stack.pop()
+            stack.append(num)
+        return False
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public boolean find132pattern(int[] nums) {
+        int ak = Integer.MIN_VALUE;
+        Deque<Integer> stack = new ArrayDeque<>();
+        for (int i = nums.length - 1; i >= 0; --i) {
+            if (nums[i] < ak) {
+                return true;
+            }
+            while (!stack.isEmpty() && nums[i] > stack.peek()) {
+                ak = stack.pop();
+            }
+            stack.push(nums[i]);
+        }
+        return false;
+    }
+}
 ```
 
 ### **...**

solution/0400-0499/0456.132 Pattern/README_EN.md

@@ -73,13 +73,38 @@ that <b>i</b> < <b>j</b> < <b>k</b> and a<sub><b>i</b></sub> < a<sub><b>k</b></s
 ### **Python3**
 
 ```python
-
+class Solution:
+    def find132pattern(self, nums: List[int]) -> bool:
+        ak = float('-inf')
+        stack = []
+        for num in nums[::-1]:
+            if num < ak:
+                return True
+            while stack and num > stack[-1]:
+                ak = stack.pop()
+            stack.append(num)
+        return False
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public boolean find132pattern(int[] nums) {
+        int ak = Integer.MIN_VALUE;
+        Deque<Integer> stack = new ArrayDeque<>();
+        for (int i = nums.length - 1; i >= 0; --i) {
+            if (nums[i] < ak) {
+                return true;
+            }
+            while (!stack.isEmpty() && nums[i] > stack.peek()) {
+                ak = stack.pop();
+            }
+            stack.push(nums[i]);
+        }
+        return false;
+    }
+}
 ```
 
 ### **...**

solution/0400-0499/0456.132 Pattern/Solution.py

@@ -0,0 +1,11 @@
+class Solution:
+    def find132pattern(self, nums: List[int]) -> bool:
+        ak = float('-inf')
+        stack = []
+        for num in nums[::-1]:
+            if num < ak:
+                return True
+            while stack and num > stack[-1]:
+                ak = stack.pop()
+            stack.append(num)
+        return False