Gray Code

[leetcode]Gray Code

链接：https://leetcode.com/problems/gray-code/description/

Question

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.

Example 1

Input: 2
Output: [0,1,3,2]
Explanation:
00 - 0
01 - 1
11 - 3
10 - 2

For a given n, a gray code sequence may not be uniquely defined.
For example, [0,2,3,1] is also a valid gray code sequence.

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

Example 2

Input: 0
Output: [0]
Explanation: We define the gray code sequence to begin with 0.
             A gray code sequence of n has size = 2n, which for n = 0 the size is 20 = 1.
             Therefore, for n = 0 the gray code sequence is [0].

Solution

class Solution {
public:
  set<int> myset;
  vector<int> res;

  void flip(char& c) { c = !(c-'0')+'0'; }
  int toNum(string s) {
    int cnt = 0;
    for (int i = 0; i < s.size(); i++)
      if (s[i] == '1')
        cnt += (1 << i);
    return cnt;
  }
  void dfs(string str) {
    int strNum = toNum(str);
    if (myset.count(strNum) > 0) return;
    myset.insert(strNum);
    res.push_back(strNum);

    for (int i = 0; i < str.size(); i++) {
      flip(str[i]);
      dfs(str);
      flip(str[i]);
    }
  }

  vector<int> grayCode(int n) {
    string ori(n, '0');
    dfs(ori);
    return res;
  }
};

思路：基本的回溯算法，和组合数的解法差不多。