位操作－leetcode 476. Number Complement

原题链接：Number Complement

题解：

class Solution {
public:
    int findComplement(int num) {
        long int flag=1;
		long int res=0;
		while(flag && flag<=num){
			int t=flag#
			if(t==0){
				res |=flag;
			}
			flag=flag<<1;
		}
		return res;
    }
};