集合中寻找和为某值的子集

public class cumt { int [] array = new int[]{1,2,3,4,5,6,7,8,9,0}; int hope = 15; public void action(int index,int hope,int[] array,String tai){ String xyz=""; for (int i = index; i < array.length; i++) { int j = array[i]; xyz = tai + " + " + j; if(j<hope){ action(i+1,hope-j,array,xyz); } if(j==hope){ System.out.println(xyz.substring(3)+" ="+this.hope); tai = ""; } } } public static void main(String[] args) { cumt cumt = new cumt(); cumt.action(0, cumt.hope, cumt.array, ""); }}运行结果如下：1 + 2 + 3 + 4 + 5 =151 + 2 + 3 + 9 =151 + 2 + 4 + 8 =151 + 2 + 5 + 7 =151 + 3 + 4 + 7 =151 + 3 + 5 + 6 =151 + 5 + 9 =151 + 6 + 8 =152 + 3 + 4 + 6 =152 + 4 + 9 =152 + 5 + 8 =152 + 6 + 7 =153 + 4 + 8 =153 + 5 + 7 =154 + 5 + 6 =156 + 9 =157 + 8 =15