链接: li1
#include <iostream>
using namespace std;
int main() {
string a;
getline(cin, a);
cout << a.size() - a.find_last_of(" ")-1;
{
}
}
链接: li2
class Solution {
public:
bool isPalindrome(string s) {
for (int i = 0; i < s.size(); i++)
{
if (s[i] >= 'A' && s[i] <= 'Z')
{
s[i] += 'a' - 'A';
}
else if ((s[i] >= '0' && s[i] <= '9') || s[i] >= 'a' && s[i] <= 'z')
{
}
else
{
s.erase(i, 1);
i--;
}
}
string s1 = s;
reverse(s1.begin(), s1.end());
return s1==s;
}
};
链接: li3
class Solution {
public:
string reverseStr(string s, int k) {
int K = 2*k;
string::iterator b = s.begin();
while (K <= s.size())
{
reverse(b,b+k);
b += 2 * k;
K += 2*k;
}
reverse(b, s.end()<(b+k)?s.end():(b+k));
return s;
}
};