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. LeetCode Problem - 670 class Solution { public int maximumSwap(int num) { // Convert the nu...