Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- 方案1:
- int solution1(int x) {
- int count = 0;
- for (int i=0; i<32; i++) {
- if (i & 1 == 1) {
- count++''
- }
- }
- return count;
- }
- 没啥好说的。
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement