题解 | #字符串变形#
字符串变形
https://www.nowcoder.com/practice/c3120c1c1bc44ad986259c0cf0f0b80e
#include <string> class Solution { public: /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param s string字符串 * @param n int整型 * @return string字符串 */ string trans(string s, int n) { // write code here if(s.size() == 0) return ""; string ans = ""; vector<string> myStr; int pre = 0; for(int i = 0;i<s.size();i++) { if(s[i] >= 'a' && s[i] <= 'z') s[i] -= 32; else if(s[i] >= 'A' && s[i] <= 'Z') s[i] += 32; if(s[i] == ' ') { myStr.push_back(s.substr(pre,i-pre)); myStr.push_back(" "); pre = i+1; } else if(i == s.size()-1) { myStr.push_back(s.substr(pre,i-pre+1)); } } for(int i = myStr.size()-1;i>=0;i--) { ans += myStr[i]; } return ans; } };