输入一个递增排序的数组和一个数字S，在数组中查找两个数，是的他们的和正好是S，如果有多对数字的和等于S，输出两个数的乘积最小的。

import java.util.ArrayList;


public class Solution{
public ArrayList<Integer> FindNumbersWithSum(int[] array, int sum) {
ArrayList<Integer> list = new ArrayList<Integer>();
if (array.length == 0 || array[0] > sum) {
return list;
}
for (int i = 0; i < array.length; i++) {
if (array[i] > sum) {
break;
} else {
for (int j = 0; j < array.length; j++) {
if (i != j && array[i] + array[j] == sum) {
list.add(array[i]);
list.add(array[j]);
}
if (array[j] > sum) {
break;
}
}
}
}
if (list.size() > 2) {
System.out.println("lsit:" + list.get(0) + list.get(1)
+ list.get(2) + list.get(3));
int count = list.size() / 2;// 获取一共有多少对
int min = list.get(0) * list.get(1);
int min_first = 0;
int min_second = 0;
int index = 1;
int i = 0;
int j = 1;
while (index <= count) {
if (list.get(i) * list.get(j) <= min) {
min = list.get(i) * list.get(j);
min_first = list.get(i);
min_second = list.get(j);
}
index++;
i += 2;
j += 2;
}
list.clear();
list.add(min_second);
list.add(min_first);
}
return list;


}
}