leetcode -- Summary Ranges -- 简单

https://leetcode.com/problems/summary-ranges/

最简单的思路O(n)。但是要把code写到很短比较难

class Solution(object):
    def summaryRanges(self, nums):
        """
        :type nums: List[int]
        :rtype: List[str]
        """
        i = 0
        res = []

        while i < len(nums):
            #print i
            j = i
            p = str(nums[j])
            while j < len(nums) - 1 and nums[j + 1] == nums[j] + 1 :
                j += 1
            if j != i:
                p += '->' + str(nums[j])
            res.append(p)
            i = j+1
        return res