_1387.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.ArrayList;
importjava.util.Collections;
importjava.util.List;

publicclass_1387 {
publicstaticclassSolution1 {
publicintgetKth(intlo, inthi, intk) {
List<int[]> power = newArrayList<>();
for (inti = lo; i <= hi; i++) {
power.add(newint[] {getSteps(i), i});
 }
Collections.sort(power, (a, b) -> a[0] != b[0] ? a[0] - b[0] : a[1] - b[1]);
returnpower.get(k - 1)[1];
 }

privateintgetSteps(intnumber) {
intsteps = 0;
while (number != 1) {
if (number % 2 == 0) {
number /= 2;
 } else {
number = 3 * number + 1;
 }
steps++;
 }
returnsteps;
 }
 }
}