一个数组中有两个数字出现一次,其他都出现两次,求这两个数
#include<stdio.h>
#include<windows.h>
void findnum(int arr[], int len)
{
int i = 0;
int ret = 0;//异或后的结果
int pos = 0;//结果中二进制第一个为1的位置
int x = 0;
int y = 0;
for (i = 0; i < len; i++)
{
ret ^= arr[i];
}
for (i = 0; i < 32; i++)
{
if (1 == ((ret >> i) & 1))
{
pos = i;
break;
}
}
for (i = 0; i < len; i++)
{
if (1 == ((arr[i] >> pos) & 1))
{
x ^= arr[i];
}
else
y ^= arr[i];
}//分组异或
printf(“x=%d,y=%d”, x, y);
}
int main()
{
int arr[] = { 1, 2, 3, 4, 5, 6, 4, 3, 2, 1 };
int sz = sizeof(arr) / sizeof(arr[0]);
findnum(arr, sz);
system(“pause”);
return 0;
}
喝汽水
#include<stdio.h>
#include<windows.h>
int Drink(int i, int j)
{
int n = i / j;
int sum = n;
while (n != 1)
{
sum = sum + n/2;
if (n % 2 == 1)
{
n = n / 2 + 1;
}
else
n = n / 2;
}
return sum;
}
int main()
{
int i = 20;
int j = 1;
printf("%d\n", Drink(i,j));
system(“pause”);
return 0;
}