遇到一个面试题,用递归法实现字符串反转.

#include <stdio.h>

#include <string.h>

#include <stdlib.h>

char *reverse(char *str)

{

int len = strlen(str);

if (len > 1) {

char ctemp = str[0];

str[0] = str[len-1];

str[len-1] = '\0';

reverse(str+1);

str[len-1] = ctemp;

}

return str;

}

int main(void) {

char array[100];

memset(array, 0, 100);

strcpy(array, "adafasfaf");

printf("before reverse array is [%s]\n", array);

reverse(array);

printf("after reverse array is [%s]\n", array);

}