背包问题---非递归算法

问题：有一些重量的物品，能恰好装进背包里，用非递归的方法计算有几种情况？

解题思路：通过模拟数组排序进行组合测试

public class BeiBao_FeiDiGui {

public static void main(String[] args){
int[] data = {1,2,3,4,5,6,7,8};
int s = 11;
int[] flag = {0,0,0,0,0,0,0,0};
int count = 0;
int add = 0;
while(count <= 256){
for(int i = 0; i < flag.length; i++){
if(flag[i] == 0){
flag[i] = 1;
continue;
}else{
flag[i] = 0;
break;
}
}

for (int i = 0; i < flag.length; i++) {
if(flag[i] == 1){
add += data[i];
}
}
if(add == s){
for (int i = 0; i < flag.length; i++) {
if(flag[i] == 1){
System.out.print(data[i] + " ");
}

}
System.out.println();
}
count++;
add = 0;

}

}




}