> For the complete documentation index, see [llms.txt](https://imhuay.gitbook.io/studies/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://imhuay.gitbook.io/studies/algorithms/problems/2022/01/jian-zhi-offer6100-jian-dan-pu-ke-pai-zhong-de-shun-zi.md).
# 扑克牌中的顺子
 [](https://imhuay.gitbook.io/studies/algorithms/problems/2022/01/pages/R5NyOzkn3qAZy7wCx1pS#简单) [](https://imhuay.gitbook.io/studies/algorithms/problems/2022/01/pages/R5NyOzkn3qAZy7wCx1pS#剑指offer) [](https://imhuay.gitbook.io/studies/algorithms/problems/2022/01/pages/R5NyOzkn3qAZy7wCx1pS#排序) [](https://imhuay.gitbook.io/studies/algorithms/problems/2022/01/pages/R5NyOzkn3qAZy7wCx1pS#模拟)
**问题简述**
```
从若干副扑克牌中随机抽 5 张牌，判断是不是一个顺子；
```
详细描述
```
从若干副扑克牌中随机抽 5 张牌，判断是不是一个顺子，即这5张牌是不是连续的。2～10为数字本身，A为1，J为11，Q为12，K为13，而大、小王为 0 ，可以看成任意数字。A 不能视为 14。
示例 1:
输入: [1,2,3,4,5]
输出: True
示例 2:
输入: [0,0,1,2,5]
输出: True
限制：
数组长度为 5
数组的数取值为 [0, 13] .
来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/bu-ke-pai-zhong-de-shun-zi-lcof
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。
```
**思路**
* 排序后，统计 0 出现的次数，以及数组中的 `max_x` 和 `min_x`；
* 当`最大值 - 最小值 < 5` 时即可组成顺子；
* 若出现相同牌则提前返回 False；
Python
```python
class Solution:
def isStraight(self, nums: List[int]) -> bool:
nums.sort() # 排序
# 如果不想排序需的话，就需要另外使用一些变量来记录最大、最小和已经出现过的牌
cnt_0 = 0
for i, x in enumerate(nums[:-1]):
if x == 0: # 记录 0 的个数
cnt_0 += 1
elif x == nums[i + 1]:
return False
# return nums[-1] - nums[cnt_0] == 4 # Error，因为 0 也可以用来作为最大或最小的牌
return nums[-1] - nums[cnt_0] < 5
```
---
# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.
## 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/01/jian-zhi-offer6100-jian-dan-pu-ke-pai-zhong-de-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.