[leetcode] p338 Count Bits
2016-03-23 00:30
267 查看
class Solution { public: vector<int> countBits(int num) { vector<int> result; for (int i=0; i<num+1; i++) { if (i==0) { result.push_back(0); } else { result.push_back(result.at(i >> 1) + (i & 1)); } } return result; } };
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- 三次逆序实现数组的循环移位
- CPP 虚函数、虚函数表及虚拟继承(转)
- Java 位运算(移位、位与、或、异或、非)
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- Deploying Control Plane Policing
- 021-Merge Two Sorted Lists(合并两个排好序的单链表);leetcode