557. Reverse Words in a String III

最新推荐文章于 2024-01-04 11:20:32 发布

原创最新推荐文章于 2024-01-04 11:20:32 发布 · 217 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

108 篇文章

订阅专栏

本文介绍了一种使用 C++ 实现的方法来反转句子中每个单词的字符顺序，同时保持单词原有的顺序不变。通过一个示例展示了如何操作字符串并提供了一个简单的解决方案。

题目描述【Leetcode】

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”
Note: In the string, each word is separated by single space and there will not be any extra space in the string.

这道题就是将句子中每个单词倒置，直接用reverse函数来做：

class Solution {
public:
    string reverseWords(string s) {
        int  temp = 0;
        for(int i = 0; i <= s.length(); ++i){
            if(i == s.length() || s[i] == ' ') {
                reverse(&s[temp], &s[i]);
                temp = i + 1;
            }
        }

        return s;
    }
};