一个排好序的数组，找出两数之和为m的所有组合

Posted 2020-10-17

    public  static void getGroup(int sum, int arr[]){
        if(arr.length<=0) {
            System.out.println("数组为空");
            return;
        }
        int start = 0;
        int end =arr.length-1;
        while (start <end){
            if(arr[start]+arr[end]== sum){
                System.out.println("符合要求"+arr[start]+"，"+arr[end]);
                 start++;
                 end--;
            }else if(arr[start]+arr[end] > sum) {
                end--;
            }else if(arr[start]+arr[end] < sum){
                start++;
            }
        }
    }

    public static void main(String[] args) {
        int[] arr ={-4,2,5,6,8,9,9,10,11,19};
        getGroup(15,arr);
    }