Single Element in a Sorted Array 解题报告python 版本

最新推荐文章于 2021-01-10 20:27:26 发布

江南剑雨

最新推荐文章于 2021-01-10 20:27:26 发布

阅读量161

点赞数

分类专栏： python

本文链接：https://blog.csdn.net/u011533425/article/details/101273220

版权

python 专栏收录该内容

24 篇文章 1 订阅

订阅专栏

nums=[0,1,2,4,5,7]
result=[]
def summaryRanges(nums):

    if not nums: return []
    res = []
    i = 0
    while i < len(nums):
        j = i
        print j
        while j < len(nums) - 1 and nums[j] == nums[j + 1] - 1:
            j += 1
            print j,'debug'
        if j == i:
            print j,i
            res.append(str(nums[i]))
        else:
            res.append('%s->%s' % (str(nums[i]), str(nums[j])))
        i = j + 1
    return res

t=summaryRanges(nums)
print t
[‘0->2’, ‘4->5’, ‘7’]