AC算法打卡-数值的整次方-打印从1到最大的N位数

剑指 Offer 16. 数值的整数次方

 

class Solution {
public:
    double myPow(double x, int n) {
        double ans = 1.0;
        char flag = '+';
        long long b = n;
        if (b < 0) {
            flag = '-';
            b = -b;
        }
        while (b) {
            if (b % 2 == 1) {
                ans = ans * x;
            }
            x = x * x;
            b >>= 1;
        }
        if (flag == '-') ans = 1 / ans;
        return ans;
    }
};

剑指 Offer 17. 打印从1到最大的n位数

 

class Solution { 
public:
   vector<int> printNumbers(int n) {
       vector<int> result;
       if (n){
           for (int i = 1, max = pow(10, n); i < max; i++){
               result.push_back(i);
          }
      }

       return result;
  }
};