class Solution:
    def lexicalOrder(self, n):
        """
        :type n: int
        :rtype: List[int]
        """
        nums=range(1,n+1,1)
        str_nums=[str(x) for x in nums]
        str_nums.sort()
        return [int(x) for x in str_nums]
s=Solution()
print(s.minMalwareSpread(graph,initial))


Given an integer n, return 1 - n in lexicographical order.

For example, given 13, return: [1,10,11,12,13,2,3,4,5,6,7,8,9].

Please optimize your algorithm to use less time and space. The input size may be as large as 5,000,000