-
题目链接:786. 第 K 个最小的素数分数
-
我的题解:
class Solution { public int[] kthSmallestPrimeFraction(int[] arr, int k) { int[] res=new int[2]; double tmp=0; ArrayList<Double> doubles = new ArrayList<>(); for (int i = 0; i <arr.length; i++) { for (int j = i+1; j < arr.length; j++) { tmp=(double) arr[i]/arr[j]; doubles.add(tmp); } } Collections.sort(doubles); Double aDouble = doubles.get(k-1); double tmp2=0; for (int i = 0; i < arr.length; i++) { for (int j = i+1; j < arr.length; j++) { tmp=(double) arr[i]/arr[j]; if (tmp==aDouble){ res[0]=arr[i]; res[1]=arr[j]; } } } return res; } }
-
复杂度: