917. Reverse Only Letters*

最新推荐文章于 2024-09-13 18:11:35 发布

珍妮的选择

最新推荐文章于 2024-09-13 18:11:35 发布

阅读量284

点赞数

分类专栏： LeetCode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/Eric_1993/article/details/104112387

版权

LeetCode 专栏收录该内容

416 篇文章 4 订阅

订阅专栏

917. Reverse Only Letters*

https://leetcode.com/problems/reverse-only-letters/

题目描述

Given a string S, return the “reversed” string where all characters that are not a letter stay in the same place, and all letters reverse their positions.

Example 1:

Input: "ab-cd"
Output: "dc-ba"

Example 2:

Input: "a-bC-dEf-ghIj"
Output: "j-Ih-gfE-dCba"

Example 3:

Input: "Test1ng-Leet=code-Q!"
Output: "Qedo1ct-eeLg=ntse-T!"

Note:

S.length <= 100
33 <= S[i].ASCIIcode <= 122
S doesn’t contain \ or "

C++ 实现 1

使用 letters 记录 S 中的所有 letters, 然后翻转后再填入到 S 中.

class Solution {
public:
    string reverseOnlyLetters(string S) {
        string letters;
        for (auto &c : S) {
            if ((65 <= c && c <= 90) || (97 <= c && c <= 122)) letters += c;
        }
        std::reverse(letters.begin(), letters.end());
        int k = 0;
        for (auto &c : S) {
            if ((65 <= c && c <= 90) || (97 <= c && c <= 122))
                c = letters[k++];
        }
        return S;
    }
};