1,字符串逆序,要求不分配额外的空间。(不用递归)
可采取的思路,声明两个指针变量,分别指向字符数组的首字符和最后一个字符('\0'前的一个字符)。因为字符数组的地址是连续的,则可通过比较指针的大小来控制循环的终止。代码如下。
#include <stdio.h>
char *reverseStr( char *str )
{
char *p = str;
char *q = str;
char tmp = ' ';
while ( '\0' != *q )
{
q++;
}
q--; /** point to the last charater(before NUL) **/
/**
*** Use pointer swap str's left and str's right charater
*** one by one
**/
while ( p < q )
{
tmp = *p;
*p++ = *q;
*q-- = tmp;
}
return str;
}
int main()
{
char str[] = "I can make it!";
printf("str is: %s\n", str);
printf("reverse str is: %s\n", reverseStr( str ) );
return 0;
}
2,字符串逆序,要求不分配额外的空间。(递归)
思想和不用递归的一致,不断缩小交换的范围,重点在逆序空间的确定。代码如下。
#include <stdio.h>
#include <string.h>
#if 0
char *reverseStr( char *str )
{
char *p = str;
char *q = str;
char tmp = ' ';
while ( '\0' != *q )
{
q++;
}
q--; /** point to the last charater(before NUL) **/
/**
*** Use pointer swap str's left and str's right charater
*** one by one
**/
while ( p < q )
{
tmp = *p;
*p++ = *q;
*q-- = tmp;
}
return str;
}
#endif
char *reverseStr( char *str, int nFirst, int nLast )
{
char ch = ' ';
if ( nFirst >= nLast )
{
return str; /** Recursion exit **/
}
ch = str[nFirst];
str[nFirst] = str[nLast];
str[nLast] = ch;
reverseStr( str, nFirst + 1, nLast -1 ); /** swap other **/
}
int main()
{
char str[] = "I can make it!";
char *s = NULL;
printf("str is: %s\n", str);
s = reverseStr( str, 0, strlen( str ) - 1 );
printf("reverse str is: %s\n", s);
return 0;
}
注意main函数里,reverseStr第三个参数不是strlen( str ), 而是strlen( str ) - 1。
3,字符串逆序,要求不分配额外的空间。(交换不用临时变量)
思路,用异或运算进行交换。代码如下。
#include <stdio.h>
#include <string.h>
char *reverseStr( char *str )
{
char *address = str;
char *p = str;
while ( '\0' != *p )
{
p++;
}
p--; /** point to the last charater(before NUL) **/
while ( p > str )
{
*p = *p ^ *str;
*str = *p ^ *str;
*p = *p-- ^ *str++;
}
return address;
}
int main()
{
char str[] = "I can make it!";
printf("str is: %s\n", str);
printf("reverse str is: %s\n", reverseStr( str ) );
return 0;
}