163. Missing Ranges

https://leetcode.com/problems/missing-ranges/description/

Given a sorted integer array nums, where the range of elements are in the inclusive range [lower, upper], return its missing ranges.

Example:

Input: nums = [0, 1, 3, 50, 75], lower = 0 and upper = 99,
Output: ["2", "4->49", "51->74", "76->99"]

class Solution(object):
    def findMissingRanges(self, nums, lower, upper):
        """
        :type nums: List[int]
        :type lower: int
        :type upper: int
        :rtype: List[str]
        """
        res = []
        nums = [lower-1]+nums+[upper+1]
        for i in range(len(nums)-1):
            if not nums[i+1] <= nums[i]+1:
                if nums[i+1] == nums[i]+2:
                    res.append(str(nums[i]+1))
                else:
                    res.append(str(nums[i]+1)+'->'+str(nums[i+1]-1))
        return res