557. Reverse Words in a String III（LeetCode ）

最新推荐文章于 2021-12-31 17:19:26 发布

转载最新推荐文章于 2021-12-31 17:19:26 发布 · 46 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/wujufengyun/p/6728353.html

本文介绍了一种在保持原有单词顺序不变的情况下，对句子中每个单词的字符进行反转的方法，并通过一个具体的示例进行了演示。该方法适用于C++环境，利用了标准库中的字符串操作功能。

Given a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.

Example 1:

Input: "Let's take LeetCode contest"
Output: "s'teL ekat edoCteeL tsetnoc"

#include<iostream>
#include<string>
#include <algorithm>
#include<vector>
using namespace std;
class Solution {
public:
	string reverseWords(string s) {
		string s1="";
		string s2="";
		for (int i = 0; i < s.size(); i++)
		{
			s2 += s[i];
			if (s[i] == ' ')
			{
				for (int j = s2.size() - 2; j >= 0; j--)
				{
					s1 += s2[j];
				}
				s1 += ' ';
				s2 = "";
			}
			if (i == s.size() - 1)
			{
				for (int j = s2.size() - 1; j >= 0; j--)
				{
					s1 += s2[j];
				}
			}
			
		}
		return s1;
	}
};
int main()
{
	string s = "Let's take LeetCode contest";
	for (int i = 0; i < s.size(); i++)
		cout << s[i];
	cout << endl;
	Solution  t;
	s=t.reverseWords(s);
	for (int i = 0; i < s.size(); i++)
		cout << s[i];
	cout << endl;
	system("pause");
	return 0;
}

转载于:https://www.cnblogs.com/wujufengyun/p/6728353.html