{ "type": "code_options", "author": "https://github.com/begeekmyfriend/leetcode", "source": "solution.md", "exercise_id": "458f6358d7514fb6bcdfd7f9238c3d7a", "keywords": "位运算,数学,回溯", "title": "格雷编码", "desc": [ { "content": "\n

格雷编码是一个二进制数字系统,在该系统中,两个连续的数值仅有一个位数的差异。

\n

给定一个代表编码总位数的非负整数 n,打印其格雷编码序列。即使有多个不同答案,你也只需要返回其中一种。

\n

格雷编码序列必须以 0 开头。

\n

 

\n

示例 1:

\n
输入: 2
输出:
 [0,1,3,2]
解释:
00 - 001 - 111 - 310 - 2对于给定的 n,其格雷编码序列并不唯一。例如,[0,2,3,1] 也是一个有效的格雷编码序列。00 - 010 - 211 - 301 - 1
\n

示例 2:

\n
输入: 0
输出:
 [0]
解释:
我们定义格雷编码序列必须以 0 开头。给定编码总位数为 n 的格雷编码序列,其长度为 2n。当 n = 0 时,长度为 20 = 1。因此,当 n = 0 时,其格雷编码序列为 [0]。
", "language": "markdown" } ], "answer": [ { "content": "", "language": "cpp" } ], "prepared": [ [ { "content": "", "language": "cpp" } ], [ { "content": "", "language": "cpp" } ], [ { "content": "", "language": "cpp" } ] ], "template": { "content": "#include \n#include \nint *grayCode(int n, int *returnSize)\n{\n\tif (n < 0)\n\t{\n\t\treturn NULL;\n\t}\n\tint i, count = 1 << n;\n\tint *codes = malloc(count * sizeof(int));\n\tfor (i = 0; i < count; i++)\n\t{\n\t\tcodes[i] = (i >> 1) ^ i;\n\t}\n\t*returnSize = 1 << n;\n\treturn codes;\n}\nint main(int argc, char **argv)\n{\n\tif (argc != 2)\n\t{\n\t\tfprintf(stderr, \"Usage: ./test n\\n\");\n\t\texit(-1);\n\t}\n\tint i, count;\n\tint *list = grayCode(atoi(argv[1]), &count);\n\tfor (i = 0; i < count; i++)\n\t{\n\t\tprintf(\"%d \", list[i]);\n\t}\n\tprintf(\"\\n\");\n\treturn 0;\n}", "language": "cpp" }, "node_id": "dailycode-5a4d869e768940439c9c3f0672b4f188", "license": "csdn.net", "created_at": 1637894158, "topic_link": "https://bbs.csdn.net/topics/600470797" }