LeetCode: Gary Code

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.

class Solution {
public:
    vector<int> grayCode(int n) {
        vector<int> result;
        result.push_back(0);
        for(int i = 0; i < n; i++)
        {
            int size = result.size();
            for(int j = size - 1; j >= 0; j--)
            {
                int temp = result[j] | (1 << i);
                result.push_back(temp);
                
            }
        }
        return result;
        
    }
};

Round 2:

class Solution {
public:
    vector<int> grayCode(int n) {
        vector<int> result;
        result.push_back(0);
        for(int i = 0 ; i < n ; i++)
        {
            int size = result.size();
            for(int j = size-1; j >= 0; j--)
            {
                int cur = result[j] | 1 << i;
                result.push_back(cur);
            }
        }
        return result;
    }
};

最后

以上就是善良小懒虫为你收集整理的LeetCode: Gary Code的全部内容，希望文章能够帮你解决LeetCode: Gary Code所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错，欢迎将靠谱客网站推荐给程序员好友。