[leetcode 89] Gray Code
来源：互联网 发布：黑锋重剑淘宝 编辑：程序博客网 时间：2024/05/02 07:12
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 - 001 - 111 - 310 - 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.
思路：n的格雷码为 n^(n/2)
class Solution {public: vector<int> grayCode(int n) { vector<int> res; int size = 1<<n; for (int i = 0; i < size; i++) { res.push_back(getGrayCode(i)); } return res; } int getGrayCode(int n) { return n^(n>>1); }}; 0 0
- [leetcode 89] Gray Code
- LeetCode 89 Gray Code
- leetcode || 89、Gray Code
- Leetcode 89 Gray Code
- [leetcode] #89 Gray Code
- leetcode 89:Gray Code
- Leetcode #89 Gray Code
- LeetCode(89) Gray Code
- leetcode 89: Gray Code
- leetcode #89 Gray Code
- 【leetcode】【89】Gray Code
- leetcode 89:Gray Code
- leetcode 89 Gray Code
- LeetCode 89 Gray Code
- LeetCode 89 Gray Code
- leetcode 89 Gray Code
- Leetcode-89 Gray Code
- Leetcode 89 Gray Code
- Median of Two Sorted Arrays -- leetcode -- Python
- 农夫过河问题的c语言实现
- 東京喰種_经典台词中日双语1
- 向量叉积的应用（三角形面积，线段相交，多边形面积，多边形凹凸性）
- [Intel汇编-NASM]基本语法
- [leetcode 89] Gray Code
- 胡博君解Java中简单工厂模式
- leetcode 173: Binary Search Tree Iterator
- 2014！我过的很充实！
- java解惑之表达式之谜(谜题8)
- 搭建ThinkPHP+EasyUI+requirejs 管理框架
- 自定义dialog窗口，根据坐标可随意设置dialog显示位置，实现了窗口弹出动画
- 黑马程序员——java基础——集合中注意的问题
- Java线程面试题 Top 50
