class Solution { public: vector<int> sortedSquares(vector<int>& A) { size_t size = A.size(); for(int i = 0; i < size; ++i) { A[i] = abs(A[i]); } sort(A.begin(),A.end()); for(auto &e : A) e = e * e; return A; } }; class Solution { public: string reverseOnlyLetters(string S) { size_t size = S.size(); int i = 0; int j = size - 1; int flag1 = 0; int flag2 = 0; while(i < j) { if('a' <= S[i] && S[i] <= 'z' || 'A' <= S[i] && S[i] <= 'Z') flag1 = 1; else ++i; if('a' <= S[j] && S[j] <= 'z' || 'A' <= S[j] && S[j] <= 'Z') flag2 = 1; else --j; if(flag1 ==1 && flag2 == 1) { swap(S[i],S[j]); flag1 = flag2 = 0; ++i; --j; } } return S; } };