題目連接

https://leetcode.com/problems/number-of-1-bits/??

Number of 1 Bits

Description

Write a function that takes an unsigned integer and returns the number of ’1’ bits it has (also known as the Hamming weight).

For example,?the 32-bit integer ’11’ has binary representation 00000000000000000000000000001011, so the function should return 3.

class Solution { public:int hammingWeight(uint32_t n) {int ans = 0;while (n) {ans += n & 1;n >>= 1;}return ans;} };

轉(zhuǎn)載于:https://www.cnblogs.com/GadyPu/p/5028203.html

《新程序員》：云原生和全面數(shù)字化實踐50位技術(shù)專家共同創(chuàng)作，文字、視頻、音頻交互閱讀

總結(jié)

以上是生活随笔為你收集整理的leetcode Number of 1 Bits的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。