经典算法_位运算

1 按位异或

适用于：面试，嵌入式开发需要节约内存的场合

不借助中间变量，交换2个变量

有3种方法，1是相加，2是相乘，3是按位异或，其中按位异或最好，因为不会越界

#define _CRT_SECURE_NO_WARNINGS

#include<stdio.h>
#include<stdlib.h>

main()
{
    int a = 100;
    int b = 10;
    
    int c = 200;
    int d = 20;

    int e = 300;
    int f = 30;

    printf("a=%d,b=%d
", a, b);

    a = a + b;
    b = a - b;
    a = a - b;

    printf("a=%d,b=%d
", a, b);

    printf("c=%d,d=%d
", c, d);

    c = c*d;
    d = c / d;
    c = c / d;

    printf("c=%d,d=%d
", c, d);

    printf("e=%d,f=%d
", e, f);

    e = e^f;
    f = e^f;
    e = e^f;

    printf("e=%d,f=%d
", e, f);

    system("pause");
}