扑克牌顺子

最新推荐文章于 2021-03-12 19:02:06 发布

weixin_43994113

最新推荐文章于 2021-03-12 19:02:06 发布

阅读量105

点赞数

本文链接：https://blog.csdn.net/weixin_43994113/article/details/90757161

版权

class Solution:
    def IsContinuous(self,numbers):
    # write code here
        if not numbers:
            return False
        numbers.sort()
        n = numbers.count(0)
        newNumbers = numbers[n:]
        count = 0
        for i in range(len(newNumbers) - 1):
            if newNumbers[i+1] - newNumbers[i]>0:
                count += (newNumbers[i+1] - newNumbers[i])
            else:
                return False
        if count<=4:
            return True
        return False