feat: add python and java solutions to lcof question

* 添加题解：扑克牌中的顺子
* 原题：https://leetcode-cn.com/problems/bu-ke-pai-zhong-de-shun-zi-lcof/
* 题解：https://lc.netlify.com/#/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9861.%20%E6%89%91%E5%85%8B%E7%89%8C%E4%B8%AD%E7%9A%84%E9%A1%BA%E5%AD%90/README

Author: yanglbme

lcof/面试题61. 扑克牌中的顺子/README.md

@@ -24,20 +24,53 @@
 - 数组的数取值为 `[0, 13]`
 ## 解法
 <!-- 这里可写通用的实现逻辑 -->
+用数组 t 记录是否存在重复的数，存在则直接返回 false。
 
+遍历数组，忽略大小王(0)，求出数组的最大、最小值。若差值超过 4，则无法构成顺子，例如：`5,6,(0),8,10`。
 
 ### Python3
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
+class Solution:
+    def isStraight(self, nums: List[int]) -> bool:
+        t = [False for _ in range(14)]
+        max_val, min_val = 0, 14
+        for num in nums:
+            if num == 0:
+                continue
+            if t[num]:
+                return False
+            t[num] = True
+            max_val = max(max_val, num)
+            min_val = min(min_val, num)
+        return max_val - min_val <= 4
+
 
 ```
 
 ### Java
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public boolean isStraight(int[] nums) {
+        boolean[] t = new boolean[14];
+        int maxVal = Integer.MIN_VALUE, minVal = Integer.MAX_VALUE;
+        for (int num : nums) {
+            if (num == 0) {
+                continue;
+            }
+            if (t[num]) {
+                return false;
+            }
+            t[num] = true;
+            maxVal = Math.max(maxVal, num);
+            minVal = Math.min(minVal, num);
+        }
+        return maxVal - minVal <= 4;
+    }
+}
 ```
 
 ### ...

lcof/面试题61. 扑克牌中的顺子/Solution.java

@@ -0,0 +1,18 @@
+class Solution {
+    public boolean isStraight(int[] nums) {
+        boolean[] t = new boolean[14];
+        int maxVal = Integer.MIN_VALUE, minVal = Integer.MAX_VALUE;
+        for (int num : nums) {
+            if (num == 0) {
+                continue;
+            }
+            if (t[num]) {
+                return false;
+            }
+            t[num] = true;
+            maxVal = Math.max(maxVal, num);
+            minVal = Math.min(minVal, num);
+        }
+        return maxVal - minVal <= 4;
+    }
+}

lcof/面试题61. 扑克牌中的顺子/Solution.py

@@ -0,0 +1,14 @@
+class Solution:
+    def isStraight(self, nums: List[int]) -> bool:
+        t = [False for _ in range(14)]
+        max_val, min_val = 0, 14
+        for num in nums:
+            if num == 0:
+                continue
+            if t[num]:
+                return False
+            t[num] = True
+            max_val = max(max_val, num)
+            min_val = min(min_val, num)
+        return max_val - min_val <= 4
+