classSolution{publicinttwoSumLessThanK(int[] A,int K){//排序
Arrays.sort(A);//双指针int left =0;int right=A.length-1;//瞄点int result =-1;while(left<right){//求和int sum =A[left]+A[right];if(sum<K){
result =Math.max(result,sum);
left++;}else{
right--;}}return result;}}