jacksu wrote on 23.06.2006 18:48:

Why do you think this should be a "common" issue? I can't think of any
real-world application that would need something like that - but then maybe I
just don't know enough parts of the "real world" ;)

Thomas

public class IntArray {

   public static void main(String[] args) {
       int[] i = {3,5,3,7};
       i = new int[] {3,5,7,8,6,10,15,13,16,18};
   }
}

Very common - for coursework.

Lordy

Hint: Set<Integer>

It is quite common in coursework, and is usually done when finding the
'combinations' of a data set.

Out of your combinations algorithm, you will get, most likely, a set of
indices of your starting array, listing the indices in that particular
combination.

e.g.

1
1 2
1 3
1 4
1 2 3
1 2 4
1 3 4
1 2 3 4
2
2 3
2 4
2 3 4
3
3 4
4

Take each combination, extract the ints for those indices from the
source array.

e.g.

3
3 5
3 3
3 7
3 5 3
3 5 7
3 3 7
3 5 3 7
5
5 3
5 7
5 3 7
3
3 7
7

Sum them.

If the result is not in your output array, add it.  You might find the
Integer class and a Set<Integer> useful at this point to strip out
duplicates.

If you use a TreeSet<Integer>, they even come out sorted.

Scott