string反转

917. Reverse Only Letters

Easy

22424FavoriteShare

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!"
class Solution {
public:
    bool IsLetter(char c){
        if((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')){
            return true;
        }
        return false;
    }
    string reverseOnlyLetters(string S) {
        vector<char> Vec;
        for(int i = 0;i < S.length();i ++){
            if(IsLetter(S[i])){
                Vec.push_back(S[i]);
            }
        }
        reverse(Vec.begin(),Vec.end());
        int index = 0;
        for(int i = 0;i < S.length();i ++){
            if(IsLetter(S[i])){
                S[i] = Vec[index++];
            }
        }
        return S;
    }
};

 

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值