coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 03:26:45 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 12:43:11 +08:00
parent 58bbdfd57c
commit 2b0511d272
10721 changed files with 8123 additions and 8119 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
leetcode-cn/problem (Chinese)/扑克牌中的顺子 [bu-ke-pai-zhong-de-shun-zi-lcof].html Normal file
View File

@@ -0,0 +1,25 @@
<p>从<strong>若干副扑克牌</strong>中随机抽 <code>5</code> 张牌，判断是不是一个顺子，即这5张牌是不是连续的。2～10为数字本身，A为1，J为11，Q为12，K为13，而大、小王为 0 ，可以看成任意数字。A 不能视为 14。</p>
<p>&nbsp;</p>
<p><strong>示例&nbsp;1:</strong></p>
<pre>
<strong>输入:</strong> [1,2,3,4,5]
<strong>输出:</strong> True</pre>
<p>&nbsp;</p>
<p><strong>示例&nbsp;2:</strong></p>
<pre>
<strong>输入:</strong> [0,0,1,2,5]
<strong>输出:</strong> True</pre>
<p>&nbsp;</p>
<p><strong>限制：</strong></p>
<p>数组长度为 5&nbsp;</p>
<p>数组的数取值为 [0, 13] .</p>