在看一些编程笔试题的时候,说是不让申请中间变量,如何实现两个数据的交换,或者字符串的倒序操作,现总结归纳如下如下:
原理:
对于异或操作"^",我们应该都很熟悉,特别是在二进制数据里面:
10101010^01010101 = 11111111;
int a = 1000(00000000 00000000 00000011 11101000);
int b = 2000(00000000 00000000 00000111 11010000);
a = a^b = 1080(00000000 00000000 00000100 00111000);
b = a^b = 1000(00000000 00000000 00000011 11101000);
a = a^b = 2000(00000000 00000000 00000111 11010000);
最终实现了a和b的交换。
Demo1:两个数据的交换
void Switch(int &a,int &b)
{
a = a^b;
b = a^b;
a = a^b;
}
int main(int argc, char** argv)
{
int a = 1000;
int b = 2000;
cout<<"交换前:"<<a<<","<<b<<endl;
Switch(a,b);
cout<<"交换后:"<<a<<","<<b<<endl;
return 0;
}
结果:
Demo2:字符串倒序操作
void reverse(char *s)
{
int i = 0;
int len = strlen(s);
int j = len - 1;
while (i < j)
{
s[i] ^= s[j] ^=s[i] ^=s[j];
i++;
j--;
}
}
int main(int argc, char** argv)
{
char str[] = "HelloWorld";
printf("倒序前:%s\n",str);
reverse(str);
printf("倒序后:%s\n",str);
return 0;
}