class Solution {
public:
void reverseString(vector<char>& s) {
for(int i = 0 ,j = s.size()-1; i<j; i++,j--){
swap(s[i],s[j]);
}
}
};
class Solution {
public:
string reverseStr(string s, int k) {
int j = s.size();
int m = 2*k ;
for(int i =0; i<s.size(); i+=m){
if(j>=m){
reverse(s.begin()+i,s.begin()+i+k);
j = j -m;
}
else if(j<m && j>=k){
reverse(s.begin()+i,s.begin()+i+k);
break;
}
else{
reverse(s.begin()+i,s.end());
break;
}
}
return s;
}
};
54. 替换数字(第八期模拟笔试) (kamacoder.com)
#include <iostream>
using namespace std;
int main() {
string s;
while (cin >> s) {
int sOldIndex = s.size() - 1;
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] >= '0' && s[i] <= '9') {
count++;
}
}
s.resize(s.size() + count * 5);
int sNewIndex = s.size() - 1;
while (sOldIndex >= 0) {
if (s[sOldIndex] >= '0' && s[sOldIndex] <= '9') {
s[sNewIndex--] = 'r';
s[sNewIndex--] = 'e';
s[sNewIndex--] = 'b';
s[sNewIndex--] = 'm';
s[sNewIndex--] = 'u';
s[sNewIndex--] = 'n';
} else {
s[sNewIndex--] = s[sOldIndex];
}
sOldIndex--;
}
cout << s << endl;
}
}