-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathSolution.java
More file actions
102 lines (75 loc) · 2.44 KB
/
Solution.java
File metadata and controls
102 lines (75 loc) · 2.44 KB
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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
package hackrank.algorithm.greedy.permute;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
import java.util.stream.Collectors;
/**
* Largest Permutation Challenge
*
* @see https://www.hackerrank.com/challenges/largest-permutation
*/
public class Solution {
public static void main(String[] args) {
Sequence sequence = readInput(System.in);
System.out.println(sequence.permuteLargest().toString());
}
public static Sequence readInput(InputStream stream) {
Scanner scanner = new Scanner(stream);
int size = scanner.nextInt();
int swaps = scanner.nextInt();
List<Integer> numbers = new ArrayList<>(size);
for (int i = 0; i < size; i++) {
numbers.add(scanner.nextInt());
}
scanner.close();
return new Sequence(numbers, swaps);
}
}
class Sequence {
private int maxSwaps;
private List<Integer> numbers;
private int[] indices;
Sequence(List<Integer> numbers, int swaps) {
this.numbers = numbers;
this.maxSwaps = swaps;
// since numbers are 1 to N, make array size() + 1 and ignore 0th index
indices = new int[numbers.size() + 1];
for (int index = 0; index < numbers.size(); index++) {
int number = numbers.get(index);
indices[number] = index;
}
}
public Sequence permuteLargest() {
int swaps = 0;
int largestNumber = numbers.size();
for (int index = 0; index < numbers.size(); index++) {
if (swaps == maxSwaps) {
break;
}
int number = numbers.get(index);
if (number != largestNumber) {
int indexLargest = indexOf(largestNumber);
swap(index, indexLargest);
swaps++;
}
largestNumber--;
}
return this;
}
private int indexOf(int number) {
return indices[number];
}
private void swap(int indexFrom, int indexTo) {
int numberFrom = numbers.get(indexFrom);
int numberTo = numbers.get(indexTo);
numbers.set(indexFrom, numberTo);
numbers.set(indexTo, numberFrom);
indices[numberFrom] = indexTo;
indices[numberTo] = indexFrom;
}
@Override
public String toString() {
return numbers.stream().map(n -> String.valueOf(n)).collect(Collectors.joining(" "));
}
}