Lexicographically Smallest String After a Swap

Given a string s containing only digits, return the lexicographically smallest string that can be obtained after swapping adjacent digits in s with the same parity at most once.

Digits have the same parity if both are odd or both are even. For example, 5 and 9, as well as 2 and 4, have the same parity, while 6 and 9 do not.

LeetCode Problem - 3216

class Solution {
    public String getSmallestString(String s) {
        // Get the length of the input string
        int length = s.length();
        // Convert the input string to a character array
        char[] charArray = s.toCharArray();

        // Iterate through the character array except the last character
        for (int i = 0; i < length - 1; i++) {
            // Convert current character and next character to integers
            int currentInt = charArray[i] - '0';
            int nextInt = charArray[i + 1] - '0';

            // Check if both characters are even or odd and if the current character is greater than the next
            if ((currentInt % 2 == nextInt % 2) && (currentInt > nextInt)) {
                // Swap the current character with the next character
                char temp = charArray[i];
                charArray[i] = charArray[i + 1];
                charArray[i + 1] = temp;
                break; // Exit the loop after the first swap
            }
        }

        // Convert the character array back to a string and return it
        return new String(charArray);
    }
}