LintCode(容易)365.二进制中有多少个1（正确版）

class Solution {
public:
    /**
     * @param num: an integer
     * @return: an integer, the number of ones in num
     */

    int countOnes(int num) {
        int w;int i = 0;

        if (num == 0) w = 0;
    //num==1
    if (num == 1) w = 1;
    if (num>1||num<0)  {
       if(num<0) {num=pow(2,31)+num; i++;} 
       string s1("112"); 

    for (; num > 3; num = num / 2){
    if (num % 2 != 0) i++; 
    }
     w = s1[num-1] -'0'+ i;}
    return w; 
    }
};