题目:
https://leetcode-cn.com/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/
思路
计算出上限来算就好了
这个问题会遇到的瓶颈就是大数问题 指数太大怎么办?
class Solution {
public int[] printNumbers(int n) {
int i = 1;
int thresHold = (int)Math.pow(10,n);
int[] arr = new int[thresHold-1];
while(i<thresHold){
arr[i-1] = i;
i++;
}
return arr;
}
}