题解 | #字符串变形#
字符串变形
https://www.nowcoder.com/practice/c3120c1c1bc44ad986259c0cf0f0b80e
#include <cctype> class Solution { public: /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param s string字符串 * @param n int整型 * @return string字符串 */ string trans(string s, int n) { // write code here string temp; stack<string> stk; for (int i = 0; i < s.length(); i++) { if (s[i] != ' ') { temp += s[i]; } if (s[i] == ' ') { if (!temp.empty()) { stk.push(temp); temp.clear(); } stk.push(" "); } } if (!temp.empty()) stk.push(temp); string res; while (!stk.empty()) { temp = stk.top(); stk.pop(); for (auto it = temp.begin(); it < temp.end(); it++) { *it = islower(*it) ? toupper(*it) : tolower(*it); } res += temp; } return res; } };