class Solution { public: string trans(string s, int n) { reverse(s.begin(), s.end()); int start = 0; auto blank = s.find(' ', start); while (blank != string::npos) { reverse(s.begin() + start, s.begin() + blank); start = blank + 1; ...