leetcode---gray-code---dp

The gray code is a binary numeral system where two successive values differ in only one bit.
Given a non-negative integer n representing the total number of bits in the code, print the sequence of gray code. A gray code sequence must begin with 0.
For example, given n = 2, return[0,1,3,2]. Its gray code sequence is:
00 - 0
01 - 1
11 - 3
10 - 2
Note:
For a given n, a gray code sequence is not uniquely defined.
For example,[0,2,3,1]is also a valid gray code sequence according to the above definition.
For now, the judge is able to judge based on one instance of gray code sequence. Sorry about that.

class Solution {
public:
    vector<int> grayCode(int n) 
    {
        int m = pow(2, n);
        vector<int> dp(m, 0);
        vector<int> ans;

        dp[0] = 0;
        dp[1] = 1;
        ans.push_back(0);
        if(n == 0)
            return ans;
        ans.push_back(1);

        for(int i=2; i<=n; i++)
        {
            int k1 = pow(2, i-1);
            int k2 = pow(2, i);
            int k3 = k1 - 1;
            for(int j=k1; j<k2; j++)
            {
                dp[j] = dp[k3--] + k1;
                ans.push_back(dp[j]);
            }
        }
        return ans;
    }
};