[LeetCode] Gray Code
2013-01-29 00:28
381 查看
class Solution { public: vector<int> grayCode(int n) { // Start typing your C/C++ solution below // DO NOT write int main() function vector<int> v; v.push_back(0); for (int i = 0; i < n; i++) { int size = v.size(); for (int j = size - 1; j >= 0; j--) v.push_back(v[j]); for (int j = size; j < 2 * size; j++) v[j] += (1 << i); } return v; } };
Small Case: 0ms
Large Case: 24ms
Time: O(n * 2 ^ n)
Space: O(2^n)
相关文章推荐
- [LeetCode][Java] Gray Code
- 《leetCode》: Gray Code
- LeetCode - Gray Code
- LeetCode-Gray Code
- [LeetCode]Gray Code
- LeetCode | Gray Code
- leetcode89 Gray Code
- [LeetCode] Gray Code 解题报告
- [leetcode] 89.Gray Code
- LeetCode 089 Gray Code
- [leetcode]Gray Code
- Gray Code(Leetcode 89)
- [LeetCode]89. Gray Code
- [leetcode]Gray Code
- Leetcode: Gray Code
- [Leetcode][python]Gray Code
- leetcode -- Gray Code -- 数学题
- leetcode 89:Gray Code
- 【LeetCode】89. Gray Code解法及注释
- [leetcode] Gray Code