[LeetCode] 386. Lexicographical Numbers @ python

一．题目：
给一个整数n，让我们把区间[1,n]的所有数字按照字典顺序来排列．
For example, given 13, return: [1,10,11,12,13,2,3,4,5,6,7,8,9].

二．解题思路：
规律题．．．

class Solution(object):
    def lexicalOrder(self, n):
        """
        :type n: int
        :rtype: List[int]
        """
        result = [0]*n
        cur = 1
        for i in range(n):
            result[i] = cur
            if cur*10 <= n:
                cur *= 10
            else:
                if cur >= n:
                    cur /= 10
                cur +=1
                while cur%10 == 0:
                    cur /= 10
        return result