LeetCode #89 - Gray Code - Medium

Problem

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.

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.

Example

For example, given n = 2, return [0,1,3,2]. Its gray code sequence is:

00 - 0
01 - 1
11 - 3
10 - 2

---

Algorithm

整理一下题意：给定整数n，要求生成所有n位的格雷码。

有点像数学题，关键是了解二进制转格雷码的方法。

• 二进制码->格雷码（编码）：从最右一位起，依次将每一位与左边一位异或（XOR），作为该位对应格雷码的值，最左一位不变；

• 格雷码->二进制码（解码）：从左边第二位起，将每位与左边一位解码后的值异或，作为该位解码后的值，最左一位不变。

根据转换方法可以很容易写出代码。

代码如下。

//版本，时间复杂度O(n)
class Solution {
public:
    bool isSubsequence(string s, string t) {
        if(s.size()==0) return true;
        if(s.size()==1){
            for(int i=0;i<t.size();i++){
                if(s[0]==t[i]) return true;
            }
            return false;
        }

        int index=-1;
        bool isfind=false;
        for(int i=0;i<t.size();i++){
            if(s[0]==t[i]) {
                index=i;
                isfind=true;
                break;
            }
        }
        if(isfind) s=s.substr(1);
        else return false;

        if(index==t.size()-1) return false;
        else t=t.substr(index+1);

        return isSubsequence(s,t);
    }
};