翻转字符串

#include "stdafx.h"
#include <iostream>
#include <string>

using namespace std;
//I am a student.
void reverseString(char* s, int from, int to);
char* reverseWord(char* str, int n);
int _tmain(int argc, _TCHAR* argv[])
{
	int m = 6;
	int n = 6;
	char p[] = "I am a student.";
	cout << strlen(p) << endl;
 	reverseWord(p, strlen(p));
	cout << p << endl;
	system("pause");
	return 0;
}
void reverseString(char* s, int from, int to) {
	while (from < to) {
		char t = s[from];
		s[from++] = s[to];
		s[to--] = t;
	}
}

char* reverseWord(char* str, int n) {
	int i = 0;
	int from = 0;
	while (i < n) {
		if (str[i] == ' ') {
			reverseString(str, from, i - 1);
			from = i + 1;
		}
		if (str[i] == '.') {
			reverseString(str, from, i);
		}
		++i;
	}
	reverseString(str, 0, n - 1);
	return str;
}

算法思想是先逐个翻转每一个单词 再翻转整个字符串