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;
}
};