将字符串中的单词进行倒序

#include <iostream>
using namespace std;

void ReverseString(char * const str, const int count);

void ReverseAllWord(char *str);

int _tmain(int argc, char *argv[])
{
	char str[] = "I can do it,because I think I can";

	ReverseAllWord(str);
	
	cout << str << endl;

	getchar();
	return 0;
}

void ReverseString(char * const str, const int count)
{
	if (str == NULL || count < 2)
	{
		return;
	}

	char *start = str;
	char *end = str + count - 1;
	char tmp;

	while (end > start)
	{
		tmp = *end;
		*end = *start;
		*start = tmp;

		start++;
		end--;
	}
}

void ReverseAllWord(char *str)
{
	if (str == NULL)
	{
		return;
	}

	char *traverse = str;
	char *word_start = NULL;
	char *word_end = NULL;

	ReverseString(str, (int)strlen(str));

	while (*traverse)
	{
		if (::isalpha(*traverse))
		{
			word_start = traverse;
			word_end = traverse;
			while (*word_end && ::isalpha(*word_end))
			{
				word_end++;
			}

			int num = (int)(word_end - word_start);
			ReverseString(word_start, num);

			traverse += (num-1);
		}
		traverse++;
	}
}