在数组中找到最小的对和

Question

这就是我一直在努力实现的目标：

Input: arr[] = {1, 7, 2, 9, 6}
The pair (1, 2) will have the minimum sum pair i.e. 1 + 2 = 3

Output: (1,2)=3

Because the while loop is iterating once, I am not able to achieve the intended result. Need some help !!

public class Find_Smallest_Pair_Sum_In_Array {

    public static void main(String[] args) {

        int[] arr = { 1, 7, 2, 9, 6 };
        StringBuilder strBuilder = new StringBuilder();

        for (int i = 0; i < arr.length; i++) {
            for (int j = i + 1; j < arr.length; j++) {
                strBuilder.append("(");
                strBuilder.append(arr[i]);
                strBuilder.append(",");
                strBuilder.append(arr[j]);
                strBuilder.append(")");
                strBuilder.append("=");
                strBuilder.append(arr[i] + arr[j]);
                strBuilder.append("\n");
            }
        }
           
        Scanner scan = new Scanner(strBuilder.toString()); 

        int first, next = 0; 
        int previous = 0;
        String newStr = "";
        
        while (scan.hasNextLine()) {
            String oneLine = scan.nextLine();
            int num = Integer.parseInt(oneLine.substring(oneLine.lastIndexOf('=') + 1, oneLine.length()));
                        
            first = num;            
            if(num > previous) {
                newStr = oneLine;
                System.out.println("if :::: " +newStr);

            } else if(num < previous) {
                newStr = oneLine;
                System.out.println("else if :::: " +newStr);

            }
            previous = first;
            
        }
        System.out.println(newStr);
    }
}

Answer 1

我认为你基本上是获取数组中最小的两个数字，我希望...

这是一个不错的技巧，可能不是算法效率更高的方法，但它又快又脏：

Arrays.sort(arr); 
//This will sort your array.
if(arr.length>1){
System.out.println(arr[0]);
System.out.println(arr[1]);
}

将是您最小的两个值。并且它还会处理长度小于 2 的情况。

Answer 2

要找到最小的 2 个数字，试试这个：

int min1 = Integer.MAX_VALUE, min2 = Integer.MAX_VALUE;
for (int i : arr) {
  if (i < min1) {
    min2 = min1;
    min1 = i;
  } else if (i < min2) min2 = i;
}

Answer 3

Issue fixed with this simple solution :

    public class Find_Smallest_Pair_Sum_In_Array {

       public static void main(String[] args) {

        int[] arr = { 1, 7, 2, 9, 6 };
        StringBuilder strBuilder = new StringBuilder();

        Arrays.sort(arr);
        for (int i = 0; i < arr.length; i++) {
            for (int j = i + 1; j < arr.length; j++) {
                strBuilder.append("(");
                strBuilder.append(arr[i]);
                strBuilder.append(",");
                strBuilder.append(arr[j]);
                strBuilder.append(")");
                strBuilder.append("=");
                strBuilder.append(arr[i] + arr[j]);
                strBuilder.append("\n");
            }
        }

        Scanner scan = new Scanner(strBuilder.toString()); 
        String oneLine = "";
        int i = 0;
        while (scan.hasNextLine()) {
            oneLine = scan.nextLine();
            if(i == 0) {
                System.out.println(oneLine);
                break;
            } 
           i++; // This is not required though, but still. 
        }
    }
}

在数组中找到最小的对和

Find smallest pair sum in array

java

stringbuilder