public class Solution {
/**
* @param a:an integer array.
* @param k:a positive integer (k <= Length (a))
* @param target:a Integer
* @return A list of lists of integers
*/
static arraylist<arraylist<integer>> ArrayList = new arraylist<arraylist<integer>> ();
Static arraylist<integer> neiarraylist =new arraylist<integer> ();
public static arraylist<arraylist<integer>> choice (int[] arry,int n,int m,int m,int[] b,int target) {
int sum=0;
for (int i=n;i>=m;i--) {
if (m>1) {
B[m-1]=i-1;
Choice (Arry, I-1, M-1, M, b,target);//combination for Choice (Arry, I-1, M-1, M, b);
}
else {
Arraylist<integer> temparraylist =new arraylist<integer> ();
B[0]=i-1;
for (int j=m-1;j>=0;j--) {
Neiarraylist.add (Arry[b[j]);
SUM+=ARRY[B[J]];
}
for (int k=0;k<neiarraylist.size (); k++)
{
Temparraylist.add (Neiarraylist.get (k));
}
Neiarraylist.clear ();
if (sum==target)
Arraylist.add (temparraylist);
sum=0;
}
}
return ArrayList;
}
Public arraylist<arraylist<integer>> ksumii (int a[], int k, int target) {
Int[] B=new int[100];
int n=a.length;
int m=k;
int m=k;
Return choice (a,n,m,m,b,target);
}
}
K Number and