670 - Maximum Swap

You are given an integer num. You can swap two digits at most once to get the maximum valued number.

Return the maximum valued number you can get.

 Example 1:

Input: num = 2736
Output: 7236
Explanation: Swap the number 2 and the number 7.

Example 2:

Input: num = 9973
Output: 9973
Explanation: No swap.

 Constraints:

  • 0 <= num <= 108

C++

  • class Solution {
    public:
        int maximumSwap(int num) {
            string s = to_string(num);
            int n = s.size();
            vector<int> d(n);
            iota(d.begin(), d.end(), 0);
            for (int i = n - 2; ~i; --i) {
                if (s[i] <= s[d[i + 1]]) {
                    d[i] = d[i + 1];
                }
            }
            for (int i = 0; i < n; ++i) {
                int j = d[i];
                if (s[i] < s[j]) {
                    swap(s[i], s[j]);
                    break;
                }
            }
            return stoi(s);
        }
    };

PYTHON

  • class Solution:
        def maximumSwap(self, num: int) -> int:
            s = list(str(num))
            n = len(s)
            d = list(range(n))
    
            for i in range(n - 2, -1, -1):
                if s[i] <= s[d[i + 1]]:
                    d[i] = d[i + 1]
    
            for i in range(n):
                j = d[i]
                if s[i] < s[j]:
                    s[i], s[j] = s[j], s[i]
                    break
    
            return int(''.join(s))

JAVA

  • class Solution {
        public int maximumSwap(int num) {
            char[] s = String.valueOf(num).toCharArray();
            int n = s.length;
            int[] d = new int[n];
            for (int i = 0; i < n; ++i) {
                d[i] = i;
            }
            for (int i = n - 2; i >= 0; --i) {
                if (s[i] <= s[d[i + 1]]) {
                    d[i] = d[i + 1];
                }
            }
            for (int i = 0; i < n; ++i) {
                int j = d[i];
                if (s[i] < s[j]) {
                    char t = s[i];
                    s[i] = s[j];
                    s[j] = t;
                    break;
                }
            }
            return Integer.parseInt(String.valueOf(s));
        }
    }

Comments