1.给定已排序数组arr和k,不重复打印arr中所有相加和为k的不降序二元组
2.如输入arr={-8,-4,-3,0,2,4,5,8,9,10},k=10,找出两个数相加和为k的二元组
输出(0,10)(2,8)
扩展∶三元组呢?
思路:双指针扫描,时间复杂度为O(nlgn)
public class 排序数组中的找和因子 {
public static void main(String[] args){
int arr[] = {-8,-4,-3,0,2,4,5,8,9,10};
add(arr,0,arr.length);
}
public static void add(int[] arr,int q,int p){
int left = q;//左指针
int right = p-1;//右指针
int k = 10;//两个数相加的和
while(left<=right){
if(arr[left]+arr[right]<k){
left++;
}else if(arr[left]+arr[right]>k){
right--;
}else{
System.out.println("(" + arr[left] + "," + arr[right] + ")" );
left++;
}
}
}
}