LeetCode 89.格雷编码

class Solution {
public:
    vector<int> grayCode(int n) {
        if (n < 0) {
            return vector<int> ();
        }
        vector<int> res(1,0);
        int val = 1;
        for (int i = 0; i < n; i++) {
            for (int j = res.size() - 1; j >= 0;--j) {
                res.push_back(val + res[j]);
            }
            val *= 2;
        }
        return res;
    }
    int Power(int base, int i) {
        int total = 1;
        while (i) {
            total *= base;
            i -= 1;
        }
        return total;
    }
};