位运算练习

Leetcode136

#include<iostream>
using namespace std;
int a[100];
int size;
int singleNumber(int* nums,int numSize)
{
	int x=0;
	for(int i=0;i<numSize;i++)
	{
		x=x^nums[numSize];
	}
	return x;
} 

int main ()
{
	cin >> size;
	for(int i=0;i<size;i++)
		scanf("%d",&a[size]);
	cout <<singleNumber(a,size);
	return 0;	
} 

leetcode 146

#include<iostream>
using namespace std;
int x,y,n,count;
int main()
{
	cin >> x >> y;
	n = (x ^ y);
	count = 0;
	while(n)
	{
		n=n&(n-1);
		count++;	
	}
	cout <<count;
	return 0;
}

leetcode 693

#include<iostream>
using namespace std;
int n;
string str="yes";
int main()
{
	cin >>n;
	while(n)
	{
		if((n&3) == 0 || (n&3) == 3)
		{
			str="no";	
			break;
		}
		n>>=1;
	}
	cout <<str<<endl;
	return 0;
}