这就是我一直想实现的目标。
输入: arr[] = {1, 7, 2, 9, 6} 这对(1, 2)将有最小的和对,即1 + 2 = 3。
产量:(1,2)=3 (1,2)=3
- 因为while循环迭代了一次,我无法达到预期的结果。 需要一些帮助!
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);
}
}
我想你基本上是获得一个数组中最小的两个数,我希望... ...
这是个不错的技巧,可能不是算法上更有效的方法,但它又快又脏。
Arrays.sort(arr);
//This will sort your array.
if(arr.length>1){
System.out.println(arr[0]);
System.out.println(arr[1]);
}
将会是你最小的两个值,而且它还能处理长度小于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;
}
用这个简单的方法解决了这个问题:
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.
}
}
}