-
Notifications
You must be signed in to change notification settings - Fork 152
/
maximum-swap.js
49 lines (44 loc) · 1.28 KB
/
maximum-swap.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
/**
* Maximum Swap
*
* 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.
*/
/**
* @param {number} num
* @return {number}
*/
const maximumSwap = num => {
const digits = num.toString().split('');
// Use buckets to record the last position of digit 0 ~ 9 in this num.
const buckets = Array(10).fill(-1);
for (let i = 0; i < digits.length; i++) {
buckets[digits[i] - '0'] = i;
}
// Loop through the num array from left to right. For each position,
// we check whether there exists a larger digit in this num (start from 9 to current digit).
// We also need to make sure the position of this larger digit is behind the current one.
// If we find it, simply swap these two digits and return the result.
for (let i = 0; i < digits.length; i++) {
for (let k = 9; k > digits[i] - '0'; k--) {
if (buckets[k] > i) {
[digits[i], digits[buckets[k]]] = [digits[buckets[k]], digits[i]];
return parseInt(digits.join(''));
}
}
}
return num;
};
export { maximumSwap };