題目描述

實現一個十進制數字報數程序，請按照數字從小到大的順序返回一個整數數列，該數列從數字 1 開始，到最大的正整數 cnt 位數字結束。

示例 1:

輸入：cnt = 2
輸出：[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99]## 算法分析

找到末尾的值

完整代碼

class Solution {
public:vector<int> countNumbers(int cnt) {vector<int>ans;//1-10//2-100//3-1000int n=pow(10,cnt);for(int i=1;i<n;i++){ans.push_back(i);}return ans;}
};