1
class Solution {
2
public int kthFactor(int n, int k) {
3
ArrayList<Integer> list = new ArrayList<>();
4

5
for (int i = 1; i <= n; i++) {
6

7
if (n % i == 0) {
8
list.add(i);
9
}
10
}
11
if (list.size() < k) {
12
return -1;
13
}
14

15
return list.get(k - 1);
16
}
17
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0