LeetCode OJ Gray Code

class Solution {
public:
    vector<int> grayCode(int n) {
        vector<int> ans(1, 0);
        int increase = 1;
        for (int i = 0; i < n; i++) {
            for (int j = ans.size() - 1; j >= 0; j--) {
                ans.push_back(ans[j] + increase);
            }
            increase *= 2;
        }
        return ans;
    }
};