【剑指offer】【其它算法】17. 打印从1到最大的n位数

题目链接：https://leetcode-cn.com/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/

class Solution {
public:
    vector<int> printNumbers(int n) {
        vector<int> res;
	if (n == 0) return res;
	//打印到数组中
	for (int i=1,max=pow(10,n);i<max;i++)
	    res.push_back(i);
	return res;        
    }
};