Print all pairs of values a sorted array that sum up to a given value M

最新推荐文章于 2024-11-11 16:57:31 发布

Agile牧

最新推荐文章于 2024-11-11 16:57:31 发布

阅读量183

点赞数

分类专栏： Algorithm 文章标签： java

本文链接：https://blog.csdn.net/agileforce/article/details/88300832

版权

Algorithm 专栏收录该内容

21 篇文章 0 订阅

订阅专栏

原创转载请注明出处：http://agilestyle.iteye.com/blog/2361909

Question

Print all pairs of values a sorted array that sum up to a given value M

Example

Solution

1. Scan from both ends, calculate the sum

2. if(sum is equal to M), print and shrink the focus window

3. if(sum is less than M), shift left focus index by 1

4. if(sum is bigger than M), shift right focus index by 1

5. Stop the loop when left is larger or equal to right index

package org.fool.java.test;

public class PrintAllPairsSumToM {
    public static void main(String[] args) {
        int[] sorted = {1, 2, 3, 4, 8, 9, 9, 10};
        printAllPairs(sorted, 12);
    }

    private static void printAllPairs(int[] sorted, int m) {
        int left = 0;
        int right = sorted.length - 1;

        while (left < right) {
            int tempSum = sorted[left] + sorted[right];

            if (tempSum == m) {  // which means we find one pair
                System.out.println("Sum of {" + sorted[left] + ", " + sorted[right] + "} = " + m);

                // update the both index values
                left++;
                right--;
            } else if (tempSum > m) { // which means the temp sum is bigger than m
                right--;    // shift right focus index by 1
            } else {    // which means the temp sum is smaller than m
                left++; // shift left focus index by 1
            }
        }
    }
}

Console Output