Leetcode386. Lexicographical Numbers
2023-01-19 12:53 作者:您是打尖兒還是住店呢 | 我要投稿
Given an integer?n, return all the numbers in the range?[1, n]?sorted in lexicographical order.
You must write an algorithm that runs in?O(n)?time and uses?O(1)?extra space.?
?
Example 1:
Input: n = 13Output: [1,10,11,12,13,2,3,4,5,6,7,8,9]
Example 2:
Input: n = 2Output: [1,2]
?
Constraints:
1 <= n <= 5 * 104
沒想到能過，以為會(huì)超時(shí)的；空間反正是超了的；
Runtime18 ms
Beats
25.95%
Memory48.6 MB
Beats
54.73%
Click to check the distribution chart
標(biāo)簽：
