3216. Lexicographically Smallest String After a Swap

class Solution {
public:
    string getSmallestString(string s)
    {
        for (int i = 0; i < s.size() - 1; ++i)
        {
            if (s[i] % 2 == s[i + 1] % 2 && s[i] > s[i + 1])
            {
                swap(s[i], s[i + 1]); break;
            }
        }
        return s;
    }
};

• T: $O(N)$
• S: $O(1)$