Fastest O(n) time java solution w/ detailed explanation. Intuitive and easy to understand.

  • 7

    The below algo runs in O(n) time. The performance is pretty good.

    Logic :-

    1. We keep neglecting the digits until they are decreasing in value because there are no 2 digits we can find in this subset which we can swap to get a greater number than original. For ex. 9631.

    2. While iterating through the digits if we find the current > next digit, we store current as min and its index as minIndex. If we reach the end of the array which means that all the digits followed a decreasing trend, then there is nothing to swap and we return the original number.

    3. From the minIndex, we start our search for the greatest digit in the remaining digits. This will be our max and its index, maxIndex. The max is the digit we want to swap, but whom to swap with? The minIndex? That would be incorrect, as seen in this ex. 97482, where the min is 4 and max is 8.
      (correct answer -> 98472)

    4. There could be a digit < max whose index < minIndex. For the above ex., it is the digit 7. Hence we'll iterate through the digits from beginning till minIndex to find a digit that satisfies the above criteria. The index of that digit would be swapIndex and we want to swap the maxIndex with swapIndex to get the maximum number possible.

    In all, steps 1,2, and 3 take one pass through the digits that requires O(n) time. Step 4, in worst case will require another pass, taking O(n) time.

    class Solution {
        public int maximumSwap(int num) {          
            String temp = Integer.toString(num);     //Convert to int array (num -> digits[])
            int[] digits = new int[temp.length()];
            for (int i = 0; i < temp.length(); i++){
                digits[i] = temp.charAt(i) - '0';
            }                                       //Ignore all digits until decreasing, until (next digit > prev). store the min and minindex
            int min = digits[0], minIndex = 0;
            for (int i = 0; i < digits.length - 1; i++){
                if (digits[i + 1] > digits[i]) {
                    minIndex = i;
                    min = digits[i];
                } else if (i == digits.length - 2)  //Reached end. Nothing to swap. Return original number.           
                    return num;
            }                                       //Starting from minindex find the largest digit in the remaining digits.
            int max = min, maxIndex = -1;
            for (int j = minIndex; j < digits.length; j++){
                if (digits[j] >= max) {
                    max = digits[j];
                    maxIndex = j;
            }                                       //Iterate through the array till minIndex to find any digit that might be lesser than max 
            int result = 0, swapindex = minIndex;
            for (int i = 0; i <= minIndex; i++){
                if (digits[i] < max) {
                    swapindex = i;
            }                                       //Swap the maxIndex digit with swapIndex
            int tmp = digits[swapindex];
            digits[swapindex] = digits[maxIndex];
            digits[maxIndex] = tmp;
                                                    //Convert the result into integer(digits -> result) 
            for (int i = digits.length - 1, j = 0; i >= 0; i--) {
                result = result + (digits[j] * ((int) Math.pow(10, i)));
            return result;

  • 0

    +1 for your explanation and solution. Thanks :)

  • 0

    @KUSHAL18 Appreciate it. Thanks!

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.