leetcode 日经贴，Cpp code -Gray Code
2015-05-08 11:00
288 查看
Gray Code
class Solution {
public:
vector<int> grayCode(int n) {
vector<int> vi;
vi.push_back(0);
for (int i = 0; i < n; ++i) {
int m = vi.size();
while (m--) {
vi.push_back(vi[m] | (1 << i));
}
}
return vi;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 日经贴，Cpp code -Remove Duplicates from Sorted List
- leetcode 日经贴，Cpp code -Basic Calculator
- leetcode 日经贴，Cpp code -Max Points on a Line
- leetcode 日经贴，Cpp code -Roman to Integer
- leetcode 日经贴，Cpp code -Palindrome Partitioning II
- leetcode 日经贴，Cpp code -Populating Next Right Pointers in Each Node II
- leetcode 日经贴，Cpp code -Add and Search Word - Data structure design
- leetcode 日经贴，Cpp code -Bitwise AND of Numbers Range
- leetcode 日经贴，Cpp code -Majority Element
- leetcode 日经贴，Cpp code -Sort Colors
- leetcode 日经贴，Cpp code -Scramble String
- leetcode 日经贴，Cpp code -Binary Tree Level Order Traversal II
- leetcode 日经贴，Cpp code -Palindrome Linked List
- leetcode 日经贴，Cpp code -Remove Duplicates from Sorted List II
- leetcode 日经贴，Cpp code -Reorder List
- leetcode 日经贴，Cpp code -Path Sum
- leetcode 日经贴，Cpp code -Word Break II
- leetcode 日经贴，Cpp code -Recover Binary Search Tree
- leetcode 日经贴，Cpp code -Binary Tree Preorder Traversal
- leetcode 日经贴，Cpp code -Summary Ranges