当前位置：网站首页>Leetcode sword finger offer 17 Print from 1 to maximum n digits

Leetcode sword finger offer 17 Print from 1 to maximum n digits

2022-04-22 04:41:00 【Twilight rain forest bell】

Specific ideas ：

Input number n, Print out from... In order 1 To the biggest n A decimal number . Such as input 3, Then print out 1、2、3 Up to the biggest 3 digit 999.

In the case of large numbers, you can directly calculate the large number of strings ;

Or arrange and combine ,dfs Breakable ;

Specific code ：

class Solution {
    
public:
    vector<int> printNumbers(int n) {
    
        if(n <= 0) return vector<int>(0);
        vector<int> res;
        int num = 1;
        for(int i=0; i<n; ++i)
            num *= 10; //  such as  n=3,num Namely 1000
        for(int i=1; i<num; ++i) res.push_back(i);
        return res;
    }
};

版权声明
本文为[Twilight rain forest bell]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/04/202204220438342846.html

边栏推荐

猜你喜欢

随机推荐