-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solution.java
73 lines (58 loc) · 1.82 KB
/
Solution.java
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
//
// Greedy, String(Minimum Adjacent Swaps to Reach the Kth Smallest Number)
// https://leetcode.com/problems/minimum-adjacent-swaps-to-reach-the-kth-smallest-number/
// Created by hyungwook on 2022/03/29.
//
import java.util.Arrays;
public class Solution {
public int getMinSwaps(String num, int k) {
int length = num.length();
int[] original = new int[length];
for (int i = 0; i < length; i++) {
original[i] = num.charAt(i) - '0';
}
int[] kthSmallestNum = getKthSmallestNum(original.clone(), k);
int answer = 0;
for (int i = 0; i < length; i++) {
if (original[i] != kthSmallestNum[i]) {
int j = i + 1;
while (original[j] != kthSmallestNum[i]) {
j++;
}
while (j != i) {
swap(original, j, j - 1);
j--;
answer++;
}
}
}
return answer;
}
private int[] getKthSmallestNum(int[] original, int k) {
while (k-- > 0) {
nextPermutation(original);
}
return original;
}
private void nextPermutation(int[] original) {
int i = original.length - 2;
for (; i >= 0; i--) {
if (original[i] < original[i + 1]) {
break;
}
}
int swapIdx = original.length - 1;
for (; swapIdx > i; swapIdx--) {
if (original[swapIdx] > original[i]) {
break;
}
}
swap(original, i, swapIdx);
Arrays.sort(original, i + 1, original.length);
}
private void swap(int[] original, int i, int swapIdx) {
int tmp = original[swapIdx];
original[swapIdx] = original[i];
original[i] = tmp;
}
}