反转字符串

#include<iostream>
#include <string.h>
using namespace std;
int main()
{
char word[]= "I am a ste";
char x;
char *begin=word;
char *end=begin+ strlen(word)-1;
while (begin < end)
{
if (begin == NULL || end == NULL)
return 0;
x = *begin;
*begin = *end;
*end = x;
begin++;
end--;


}

char *index=word;
begin = end = word;
while (*index != '\0')
{

if (*index == ' ')
{
end--;
while (begin <= end)
{


x = *begin;
*begin = *end;
*end = x;
begin++;
end--;


}
begin = index + 1;
end = index;



}

end++;
index++;


}

if (*index == '\0')
{
end--;
while (begin <= end)
{


x = *begin;
*begin = *end;
*end = x;
begin++;
end--;


}
}
cout << word;
        system("pause");
return 0;

}

例如 i am a student 反转后就为 student  a am i 这里我用的是剑指offer的方法 先把整体前后反转一遍，再翻局部单词。