# 扑克牌顺子
 [](https://imhuay.gitbook.io/studies/algorithms/problems/2022/03/pages/R5NyOzkn3qAZy7wCx1pS#简单) [](https://imhuay.gitbook.io/studies/algorithms/problems/2022/03/pages/R5NyOzkn3qAZy7wCx1pS#牛客) [](https://imhuay.gitbook.io/studies/algorithms/problems/2022/03/pages/R5NyOzkn3qAZy7wCx1pS#模拟)
> [扑克牌顺子\_牛客题霸\_牛客网](https://www.nowcoder.com/practice/762836f4d43d43ca9deb273b3de8e1f4)
**问题简述**
```
现在有2副扑克牌，从扑克牌中随机五张扑克牌，我们需要来判断一下是不是顺子。
有如下规则：
1. A为1，J为11，Q为12，K为13，A不能视为14
2. 大、小王为 0，0可以看作任意牌
3. 如果给出的五张牌能组成顺子（即这五张牌是连续的）就输出true，否则就输出false。
4.数据保证每组5个数字，每组最多含有4个零，数组的数取值为 [0, 13]
```
**思路**
* 不能有重复牌；
* 最大和最小之间的差小于等于 4；
Python
```python
class Solution:
def IsContinuous(self , arr: List[int]) -> bool:
# write code here
book = set()
mx, mi, cnt0 = 1, 13, 0
for x in arr:
if x == 0:
cnt0 += 1
continue
book.add(x)
mx = max(mx, x)
mi = min(mi, x)
# 组成顺子的条件：没有重复牌，最大和最小的差小于等于 4
return len(book) == 5 - cnt0 and mx - mi <= 4
```
---
# Agent Instructions: Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.
Perform an HTTP GET request on the current page URL with the `ask` query parameter:
```
GET https://imhuay.gitbook.io/studies/algorithms/problems/2022/03/niu-ke-0063-jian-dan-pu-ke-pai-shun-zi.md?ask=
```
The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.
Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.