【leetcode】Gray Code
2015-04-21 16:24
288 查看
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
Note:
For a given n, a gray code sequence is not uniquely defined.
For example,
For now, the judge is able to judge based on one instance of gray code sequence. Sorry about that.
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) { // Start typing your C/C++ solution below // DO NOT write int main() function vector<int> res; res.push_back(0); int highbit = 0; while(n--) { highbit = res.size(); for(int i= res.size()-1; i >= 0; i--) res.push_back(highbit|res[i]); } return res; } };
相关文章推荐
- [leetcode]Gray Code
- Leetcode88: Gray Code
- Java for LeetCode 089 Gray Code
- leetcode 89:Gray Code
- 【LeetCode】89. Gray Code解法及注释
- LeetCode 89: Gray Code 格雷码
- LeetCode - Gray Code
- LeetCode-Gray Code
- LeetCode | Gray Code
- 【leetcode】【89】Gray Code
- LeetCode-89-Gray Code
- LeetCode 089 Gray Code
- [Leetcode]Gray Code
- leetcode 日经贴,Cpp code -Gray Code
- Leetcode 89 Gray Code
- LeetCode题解:Gray Code
- Gray Code -- LeetCode
- 【Leetcode】Gray Code 见过最无耻最没头脑的题 in JAVA
- Gray Code -- LeetCode
- LeetCode|Gray Code