1 class Solution { 2 // you need to treat n as an unsigned value 3 public int hammingWeight(int n) { 4 int res = 0; 5 for(int i = 0; i < 32; i++) { 6 if((n & 1) != 0) { 7 res++; 8 } 9 n>>>=1; 10 } 11 return res; 12 } 13 }
191. Number of 1 Bits(Binary)
猜你喜欢
转载自www.cnblogs.com/goPanama/p/9398928.html
今日推荐
周排行