题目
来源:力扣(LeetCode)
链接:格雷码
代码
class Solution {
public:
/* dp[i-1][j] 0<=j<N/2
dp[i][j]=
dp[i-1][N-j-1]+1<<(i-1) N/2<=j<N
*/
vector<int> grayCode(int n) {
//从n-1位格雷码推出n位格雷码
int N
来源:力扣(LeetCode)
链接:格雷码
class Solution {
public:
/* dp[i-1][j] 0<=j<N/2
dp[i][j]=
dp[i-1][N-j-1]+1<<(i-1) N/2<=j<N
*/
vector<int> grayCode(int n) {
//从n-1位格雷码推出n位格雷码
int N