题解 | #扑克牌顺子#
扑克牌顺子
http://www.nowcoder.com/practice/762836f4d43d43ca9deb273b3de8e1f4
# -*- coding:utf-8 -*-
class Solution:
def IsContinuous(self, numbers):
numbers.sort()
zero_count = 0
i = 0
while numbers[i] == 0:
i += 1
zero_count += 1
interapt = 0
for idx in range(i, len(numbers)-1):
if numbers[idx] == numbers[idx+1]:
return False
interapt += numbers[idx+1] - numbers[idx] - 1
if interapt > zero_count:
return False
return True
class Solution:
def IsContinuous(self, numbers):
numbers.sort()
zero_count = 0
i = 0
while numbers[i] == 0:
i += 1
zero_count += 1
interapt = 0
for idx in range(i, len(numbers)-1):
if numbers[idx] == numbers[idx+1]:
return False
interapt += numbers[idx+1] - numbers[idx] - 1
if interapt > zero_count:
return False
return True
查看22道真题和解析