单词翻转

songtianming

于 2014-07-17 08:09:51 发布

阅读量442

点赞数 1

分类专栏：数据结构算法文章标签：单词翻转

本文链接：https://blog.csdn.net/songtianming/article/details/37899967

版权

数据结构算法专栏收录该内容

3 篇文章 0 订阅

订阅专栏

输入I love you 输出you love I

(A^T B^T)^T -> BA

所以先对单词翻转 I evol uoy，再对整个字符串翻转you love I

void reverse_str(char* left, char* right)
{
	while (left < right)
	{
		std::swap(*left, *right);
		left++;
		right--;
	}
}

void reverse_word(char *str)
{
	if (str == NULL) return;
	char *cur = str;
	char *wordBegin = cur;
	bool findingBegin = true;
	while (*cur)
	{
		if (findingBegin)
		{
			if (*cur != ' ')
			{
				wordBegin = cur;
				findingBegin = false;
			}
		}
		else
		{
			if (*cur == ' ')
			{
				reverse_str(wordBegin, cur - 1);
				findingBegin = true;
			}
			if (*(cur+1) == 0 && !findingBegin)
				reverse_str(wordBegin, cur);
		}
		++cur;
	}
	reverse_str(str, cur - 1);

}