# LeetCode89:Gray Code

788人阅读 评论(0)

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 - 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.

# 解法一

runtime:4ms

class Solution {
public:

vector<int> grayCode(int n) {
vector<int> result(1);
for(int i=0;i<n;i++)
{
for(int j=result.size()-1;j>=0;j--)
{
result.push_back((1<<i)+result[j]);
}
}
return result;
}
}；


# 解法二

runtime:4ms

class Solution {
public:
vector<int> grayCode(int n) {
vector<int> result;
for(int i=0;i<1<<n;i++)
{
result.push_back(i^i>>1);
}
return result;
}

};
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：316083次
• 积分：5998
• 等级：
• 排名：第4207名
• 原创：261篇
• 转载：43篇
• 译文：13篇
• 评论：42条
友情链接
博客专栏
 设计模式（C++） 文章：24篇 阅读：16077
 LeetCode 文章：94篇 阅读：62634
 openGL系列教程 文章：13篇 阅读：26132
文章分类
评论排行
最新评论