Advertisement
Guest User

Untitled

a guest
Jul 31st, 2015
185
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.20 KB | None | 0 0
  1. 方案1:
  2.  
  3. int solution1(int x) {
  4. int count = 0;
  5. for (int i=0; i<32; i++) {
  6. if (i & 1 == 1) {
  7. count++''
  8. }
  9. }
  10. return count;
  11. }
  12.  
  13. 没啥好说的。
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement