【C++ CSES】Gray Code

最新推荐文章于 2025-08-02 00:34:57 发布

原创

最新推荐文章于 2025-08-02 00:34:57 发布 · 315 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c++ #算法

该篇文章详细描述了如何使用C++编写一个递归函数来生成具有给定长度n的格雷码列表，适合于编程和算法学习者。

题目描述

A Gray code is a list of all 2^n bit strings of length n, where any two successive strings differ in exactly one bit (i.e., their Hamming distance is one).
Your task is to create a Gray code for a given length n.

输入

The only input line has an integer n（1 ≤ n ≤ 16）.

输出

Print 2^n lines that describe the Gray code. You can print any valid solution.

样例输入 Copy

样例输出 Copy

#include <bits/stdc++.h>
using namespace std;
vector<string> f(int n) 
{
    if (n == 0) return vector<string>{"0"};
    else if (n == 1) return vector<string>({ "0", "1" });    
    else 
    {
        vector<string> newcode;
        vector<string> code = f(n - 1);
        for (auto it = code.begin(); it != code.end(); it++)
            newcode.emplace_back("0" + *it);
        for (auto it = code.rbegin(); it != code.rend(); it