LeetCode | 557. Reverse Words in a String III

.

题目

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

Example 1:

Input: s = “Let’s take LeetCode contest”
Output: “s’teL ekat edoCteeL tsetnoc”

Example 2:

Input: s = “God Ding”
Output: “doG gniD”

Constraints:

  • 1 <= s.length <= 5 * 10^4
  • s contains printable ASCII characters.
  • s does not contain any leading or trailing spaces.
  • There is at least one word in s.
  • All the words in s are separated by a single space.

.

代码

class Solution {
public:
    string reverseWords(string s) {
        string rev, tmp;
		for(int i = 0; i<s.size(); i++){
			if(s[i] == ' '){
				reverse(tmp.begin(), tmp.end());
				rev += tmp + ' ';
				tmp.clear();
			}else
				tmp.push_back(s[i]);
		}
		reverse(tmp.begin(), tmp.end());
		rev += tmp;
		return rev;
    }
};

541是系列题目,也是一次AC ^ _________________________ ^

不过效率也有待提高~欢迎评论区讨论!

.

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值