《C程序设计语言（第2版）》练习2-7

编写一个函数invert(x,p, n)，该函数返回对x执行下列操作后的结果值：将x中从第p位开始的n个(二进制)位求反(即，1变成0，0变成1)，x的其余各位保持不变。

uint invert(uint x, uint p, uint n)
{
    //获得中间为n个1的二进制数
    uint temp = ~(~0 << n) << (p + 1 - n);
    //获得x中间的n位
    uint temp1 = temp & x;
    //x中间位清1
    x |= temp;
    return x & (~temp1);
    //return x ^ (~(~0 << n) << (p + 1 - n))
}

测试代码

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef unsigned char uchar;
typedef unsigned int uint;

uint invert(uint x, uint p, uint n);
void GetChoiceBin(unsigned int num, int choice);//根据选择打印二进制数
void GetBin(char *p, int num);

int main(void)
{
    uint x = 0;
    uint z = 0;
    scanf("%u", &x);

    GetBin("char", x);
    z = invert(x, 4, 3);
    printf("z = invert(x, 4, 3) = %d\n", z);
    GetBin("char", z);

    return 0;
}
uint invert(uint x, uint p, uint n)
{
    //获得中间为n个1的二进制数
    uint temp = ~(~0 << n) << (p + 1 - n);
    //获得x中间的n位
    uint temp1 = temp & x;
    //x中间位清1
    x |= temp;
    return x & (~temp1);
    //return x ^ (~(~0 << n) << (p + 1 - n))
}
void GetBin(char *p, int num)
{
    //char还是int类型
    char *array[] = {
        "char",
        "int",
    };
    //字符串列表长度，可以自己扩充，现在是2
    int choiceLength = sizeof(array) / sizeof(array[0]);
    for (int i = 0; i < choiceLength; i++)
    {
        if (!strncmp(p, array[i], 4))//遍历发现有对应字符串
        {
            GetChoiceBin(num, i); //i是列表中字符串序号，0是char，1是int
            return ;
        }
    }
    printf("No find!\n");
}
void GetChoiceBin(unsigned int num, int choice)//根据选择打印二进制数
{
    unsigned int length = 0;
    if (choice == 0)
    {
        if (num > 255)
        {
            printf("The char can`t big 255!\n");
            exit(EXIT_FAILURE);
        }
        length = sizeof(char) * 8;
    }
    if (choice == 1)
        length = sizeof(int) * 8;
    unsigned int array[length]; //一个能放最大长度的数组

    int i = 0;
    int count = 1;
    for (i = 0; num != 0; i++)
    {
        array[i] = num % 2; //余数放在数组中
        num /= 2;
    }
    //打印开始的0
    for (int j = 0; j < length - i; j++, count++)
    {
        printf("0");
        if (count % 4 == 0)
        {
            printf("-");
        }
    }
    //打印刚才求的二进制，注意是逆序
    for (--i; i >= 0; i--, count++)
    {
        printf("%d", array[i]);
        if (count % 4 == 0 && count != length)
        {
            printf("-");
        }
    }
    printf("\n");
}