剑指Offer15:二进制中1的个数(Golang/Python/C#)

原题连接：剑指Offer15:二进制中1的个数

• 时间复杂度O(logn):此算法循环内部仅有移位、与、加等基本运算，占用O(1);逐位判断需循环 logn次，其中 log2n代表数字n最高位1的所在位数（例如log24 =2,log216=4)。
• 空间复杂度O(1):变量res使用常数大小额外空间。

Golang

package main

import "fmt"

func hammingWeight(num uint32) int {
	numNew := int(num)
	res := 0
	for ; numNew > 0; {
		res += int(numNew) & 1
		numNew >>= 1
	}
	return res
}

func main() {
	fmt.Println(hammingWeight(11))
}

Python

class Solution:
    def hammingWeight(self, n: int) -> int:
        res = 0
        while n:
            res += n & 1
            n >>= 1
        return res


if __name__ == "__main__":
    solution = Solution()
    print(solution.hammingWeight(11))

C#

public class Solution
{
    public int HammingWeight(uint n)
    {
        int res = 0;
        while (n > 0) {
            res += (int)n & 1;
            n >>= 1;
        }
        return res;
    }
}
class Program
{
    static void Main(string[] args)
    {
        Solution solution = new Solution();
        Console.WriteLine(solution.HammingWeight(11));
    }
}