Evaluate the number of 1 in the binary of an integer

Question: enter an integer to calculate the number of 1 in the Binary Expression of this integer. For example, input 10. Because the binary value is 1010 and there are two 1 s, Output 2.

Assume that the integer is I. First, perform operations on I and 1 to determine if the I percentile is 1. Then, shift 1 to the left to get 2, and then perform operations with I to determine whether the secondary high of I is 1 ...... In this way, the Left shift is repeated, and each time you can judge whether one of the I is 1. Based on this, we get the following code:

Int numberof1_solution (int I) {int COUNT = 0; unsigned int flag = 1; while (FLAG) {if (I & flag) Count ++; flag = Flag <1;} return count ;}