写一个宏可以将一个数字的二进制代码的奇数位和偶数位交换

1、写一个宏可以将一个数字的二进制代码的奇数位和偶数位交换。

#include<stdio.h>
#include<stdlib.h>
#define SWAP(x) (((x&0xaaaaaaaa)>>1)+((x&0x55555555)<<1))
int main()
{
	int a = 10;
	int ret = SWAP(a);
	printf("ret = %d\n", ret);
	system("pause");
	return 0;
}

结果为：5

2、两个int（32位）整数m和n的二进制表达中，有多少个位(bit)不同？ 

#include<stdio.h>
#include<stdlib.h>
int main()
{
	int m = 2299;
	int n = 1999;
	int count = 0;
	int ret = m^n;
	while (ret)
	{
		count++;
		ret = ret&(ret - 1);
	}
	printf("%d\n", count);
	system("pause");
	return 0;
}

3.有一个字符数组的内容为:"student a am i",请你将数组的内容改为"i am a student".
要求：
不能使用库函数。只能开辟有限个空间（空间个数和字符串的长度无关）。

#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
void reverse(char* left, char* right)
{
	assert(left && right);
	while (left < right)
	{
		char tmp = *left;
		*left = *right;
		*right = tmp;
		left++;
		right--;
	}
}

int main()
{
	char arr[] = "student a am i";
	char *cur = arr;
	char *start = arr;
	//翻转字符串
	reverse(arr,arr+sizeof(arr)/sizeof(arr[0])-2);
	//逐个翻转单词
	while (*cur)
	{
		start = cur;
		while ((*cur != ' ')&&(*cur != '\0'))
		{
			cur++;
		}
		reverse(start, cur - 1);
		if (*cur != '\0');
		cur++;
	}
	printf("%s\n", arr);
	system("pause");
	return 0;
}

还有没有更好的办法呢？

当然有：

#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
void reverse(char* left, char* right)
{
	assert(left && right);
	while (left < right)
	{
		char tmp = *left;
		*left = *right;
		*right = tmp;
		left++;
		right--;
	}
}

void reverse_str(char *left, char *right)
{
	char *cur = left;
	char *start = right;
	reverse(left, right);
	while (*cur)
	{
		start = cur;
		while ((*cur != ' ') && (*cur != '\0'))
		{
			cur++;
		}
		reverse(start, cur - 1);
		if (*cur != '\0');
		cur++;
	}
}

int main()
{
	char arr[] = "student a am i";
	reverse_str(arr,arr+sizeof(arr)/sizeof(arr[0])-2);
	printf("%s\n", arr);
	system("pause");
	return 0;
}

4.编写函数：
unsigned int  reverse_bit(unsigned int value);

这个函数的返回 值value的二进制位模式从左到右翻转后的值。

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

unsigned int reverse_bit(unsigned int value)
{
	int i = 0;
	unsigned int ret = 0;
	for (i = 0; i < 32; i++)
	{
		ret += ((value >> i) & 1)*pow(2, 31 - i);
	}
	return  ret;
}

int main()
{
	int num = 25;
	unsigned int ret = reverse_bit(num);
	printf("%u\n", ret);
	system("pause");
	return 0;
}

5、实现一个函数使得数组的奇数位于前部分，偶数位于后半部分

void arr_move(int arr[], int sz)
{
	int *left = arr;
	int *right = arr + sz - 1;
	while (left<right)
	{
		while ((left<right)&&(*left) % 2 == 1)
		{
			left++;
		}
		while ((left<right)&&(*right) % 2 == 0)
		{
			right--;
		}
		if (left < right)
		{
			int tmp = *left;
			*left = *right;
			*right = tmp;
		}
		left++;
		right--;
	}
}
int main()
{
	int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
	int i = 0;
	int sz = sizeof(arr) / sizeof(arr[0]);
	arr_move(arr, sz);
	for (i = 0; i < sz; i++)
	{
		printf("%d ",arr[i]);
	}
	system("pause");
	return 0;
}