Shulou(Shulou.com)05/31 Report--

This article mainly explains "how to find the number of 1s in C++". Interested friends may wish to have a look. The method introduced in this paper is simple, fast and practical. Next, let the editor take you to learn "C++ how to find the number of 1s"!

Algorithm:

The core is the calculation of the number of 1s of a single number, and other problems are based on this basis.

Topic 1: find the number of 1

Code implementation:

Func hammingWeight (num uint32) int {count: = 0 for I: = 0; I < 32; iTunes + {if num& (11} return c})

Topic 3: binary represents the calculation positions of prime numbers

Code implementation:

Func countPrimeSetBits (L int, R int) int {/ / prime number can only be divisible by 1 and itself, and the maximum R value is 10 ^ 6, that is, 2 ^ 20, so the prime number is as follows: = [] int {2lt 3lt 5lt 7lt 13lt 19} m: = make (map [int] int) for _, v:=range s {m [v] = v} / / calculate the number of 1s in each number c: = 0 for iMOS

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.