数组的所有子序列java_求数组中和为给定值的所有子序列

packagecom.didi;importjava.util.ArrayList;importjava.util.Arrays;importjava.util.Scanner;public classMain1 {/***@paramargs*/

public static voidmain(String[] args) {//TODO Auto-generated method stub

Scanner scanner= newScanner(System.in);while(scanner.hasNext()){int n =scanner.nextInt();int sum =scanner.nextInt();int[] arr = new int[n];for(int i=0;i

arr[i]=scanner.nextInt();

}Arrays.sort(arr);//必须先排序

ArrayList> lists = new ArrayList>();boolean[] visited = new boolean[n];

backTrack(arr, visited,0, 0, sum, lists);//求和为sum的所有组合数

System.out.println(lists);

System.out.println(lists.size());//求和为sum的所有组合数

System.out.println(maxFighting(lists));//求最大组合攻击力

}

}//求非降序序列中和为定值的所有组合，必须为非降序序列，否则会重复，如{2 4 2 5 4 1 6}-->[[2, 4, 4], [2, 2, 5, 1], [4, 2, 4], [4, 5, 1], [5, 4, 1]],统计有重复只是顺序不一样

public static void backTrack(int[] input, boolean[] visited, intn,int sum, int key, ArrayList>lists){if(sum>key)return;if(sum==key){

ArrayList list = new ArrayList();for(int j=0; j<=n; j++){if(visited[j]){

list.add(input[j]);

}

}

lists.add(list);return;

}if(n>=input.length)return;for(int i=n;i

sum+=input[i];

visited[i]= true;

backTrack(input, visited, i+1, sum, key, lists);

visited[i]= false;

sum-=input[i];while(i

i++;

}

}

}public static int maxFighting(ArrayList>lists){int size =lists.size();if(lists==null||size==0)return -1;int maxMultipy =Integer.MIN_VALUE;int multipy = 1;for(int i=0;i

ArrayList list =lists.get(i);for(int j=0;j

multipy*=list.get(j);

}if(multipy>maxMultipy){

maxMultipy=multipy;

}

multipy= 1;

}returnmaxMultipy;

}

}