Given a non-negative integer, you could swap two digits at most once to get the maximum valued number. Return the maximum valued number you could get.
Example 1:
Input: 2736
Output: 7236
Explanation: Swap the number 2 and the number 7.
Example 2:
Input: 9973
Output: 9973
Explanation: No swap.
Note:
- The given number is in the range [0, 108]
思路:算法:讲num转换成string进行处理,用array去记录每个数字出现的最后一个位子的index;
然后从左往右扫,对于每个digit,从9开始往下数,如果发现后面有比他大的digit,swap就是答案;
class Solution {
public int maximumSwap(int num) {
char[] ss = String.valueOf(num).toCharArray();
int[] pos = new int[10];
Arrays.fill(pos, -1);
// 用array去count,每个数字出现的最后一个位子的index;
for(int i = 0; i < ss.length; i++) {
pos[ss[i] - '0'] = i;
}
// 从左往右扫,每个digit,如果发现后面有比他大的,swap就是答案;
for(int i = 0; i < ss.length; i++) {
for(int j = 9; j >= 0; j--) {
if(pos[j] != -1 && j > ss[i] - '0' && pos[j] > i) {
char temp = ss[i];
ss[i] = ss[pos[j]];
ss[pos[j]] = temp;
return Integer.parseInt(new String(ss));
}
}
}
return num;
}
}