GoLang Solution For LeetCode Problem: Gray Code
Solving Gray Code in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
The gray code is a binary numeral system where two successive values differ in only one bit.
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
Input: 0 Output:  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 .
See the full details of the problem Gray Code at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go