題目

不重復打印排序數組中相加和為給定值的所有二元組和三元組

java代碼

package com.lizhouwei.chapter8;

/**
 * @Description: 不重復打印排序數組中相加和為給定值的所有二元組和三元組
 * @Author: lizhouwei
 * @CreateDate: 2018/5/7 21:27
 * @Modify by:
 * @ModifyDate:
 */
public class Chapter8_9 {

    public void printUniquePair(int[] arr, int k) {
        if (arr == null || arr.length < 2) {
            return;
        }
        int left = 0;
        int right = arr.length - 1;
        while (left < right) {
            if (arr[left] + arr[right] < k) {
                left++;
            } else if (arr[left] + arr[right] > k) {
                right--;
            } else {
                if (left == 0 || arr[left] != arr[left - 1]) {
                    System.out.println(arr[left] + "," + arr[right]);
                    left++;
                    right--;
                }
            }
        }
    }

    public void printUniqueTriad(int[] arr, int k) {
        for (int i = 0; i < arr.length - 2; i++) {
            if (i == 0 || arr[i] != arr[i - 1]) {
                printRest(arr, i, i + 1, arr.length - 1, k - arr[i]);
            }
        }
    }

    public void printRest(int[] arr, int pre, int left, int right, int k) {
        while (left < right) {
            if (arr[left] + arr[right] < k) {
                left++;
            } else if (arr[left] + arr[right] > k) {
                right--;
            } else {
                if (left == pre || arr[left] != arr[left - 1]) {
                    System.out.println(arr[pre] + "," + arr[left] + "," + arr[right]);
                    left++;
                    right--;
                }
            }
        }
    }

    //測試
    public static void main(String[] args) {
        Chapter8_9 chapter = new Chapter8_9();
        int[] arr = {-8, -4, -3, 0, 1, 2, 4, 5, 6, 9};
        System.out.println("數組 arr = {-8, -4, -3, 0, 1, 2, 4, 5, 6, 9}中和為10的二元組:");
        chapter.printUniquePair(arr, 10);
        System.out.println("數組 arr = {-8, -4, -3, 0, 1, 2, 4, 5, 6, 9}中和為10的三元組:");
        chapter.printUniqueTriad(arr, 10);
    }
}
 

結果

《程序員代碼面試指南》第八章 數組和矩陣問題 不重復打印排序數組中相加和為給定值的所有二元組和三元組