344.反转字符串
1.直接reverse
class Solution {
public:
void reverseString(vector<char>& s) {
reverse(s.begin(),s.end());
return ;
}
};
2.双指针
class Solution {
public:
void reverseString(vector<char>& s) {
int n = s.size();
for (int left = 0, right = n - 1; left < right; ++left, --right) {
swap(s[left], s[right]);
}
}
};
514.反转字符串Ⅱ
class Solution {
public:
string reverseStr(string s, int k) {
int len =s.length();
for(int i=0;i<len;i+=2*k)
{
if(i+k<=len)
{
reverse(s.begin()+i,s.begin()+i+k);
}else{
reverse(s.begin()+i,s.end());
}
}
return s;
}
};
卡码网:54.替换数字
#include<iostream>
using namespace std;
#include<string>
int main()
{
string s;
cin>>s;
string ss;
for(int i=0;i<s.length();i++)
{
if(isdigit(s[i]))
{
ss+="number";
}else{
ss+=s[i];
}
}
cout<<ss<<endl;
}
151.翻转字符串里的单词
class Solution {
public:
string reverseWords(string s) {
string ss;
int m = s.length()-1;
while(s[m] == ' ' &&m>0)
{
m--;
}
int n=m;
while(m>=0)
{
while(m>=0 && s[m]!=' ') m--;
ss += s.substr(m+1,n-m)+" ";
while(m>=0 && s[m]==' ') m--;
n =m;
}
return ss.substr(0,ss.length()-1);
}
};
卡码网:55.右旋转字符串
#include<iostream>
using namespace std;
#include<string>
int main()
{
int n;
cin>>n;
string s;
cin>>s;
if(n==s.length())
{
cout<<s;
return 0;
}
string s1 = s.substr(0,s.length()-n);
string s2 = s.substr(s.length()-n);
cout<<s2+s1<<endl;
}