Find best container - Cracking Code

Find best container – Cracking Code
現在給某個容量(double capacity), 還有一個array(double[] weights), 和int numOfContainers 主要是要在array中選出兩個weights總和小於等於capacity但最接近capacity.然後指定到一個Container object並且return

1. public static Container findOptimalWeight(double[] weights, double target) {
2. Container result = new Container(0, 0);
3. if (weights == null || weights.length < 2) return result;
4.  
5. Arrays.sort(weights);
6. int lo = 0, hi = weights.length - 1, first = lo, second = hi;
7. while (lo < hi) {
8. if (weights[lo] + weights[hi] == target) {
9. first = lo;
10. second = hi;
11. break;
12. } else if (weights[lo] + weights[hi] > target) {
13. hi --;
14. } else {
15. if (target < weights[first] + weights[second] || target - (weights[first] + weights[second]) > target - (weights[lo] + weights[hi])) {
16. first = lo;
17. second = hi;
18. }
19. lo ++;
20. }
21. }
22. result.first = weights[first];
23. result.second = weights[second];
24. return result;
25. }

Extended:
How about select k elements, or any number?
-- K sum closest
Read full article from Find best container – Cracking Code