Java区间拆分子集求和_将数组分割成差值最小的子集

本文使用

位掩码实现一个功能 ==》将数组分割成差值最小的子集

代码如下：import java.util.Arrays;

public class MinimalDifference {

/**

* 将数组分割成差值最小的子集

*/

public void printTwoMinDiffGroups(int[] values) {

int length = values.length;

// 长度为length的二进制表示个数有1<

int allMasks = 1 << length;

int min = Integer.MAX_VALUE;

int value = 0;

for (int i = allMasks - 1; i >= 0; i--) {

int diff = 0;

for (int j = 0; j < length; j++) {

diff += (i & (1 << j)) == 0 ? values[j] : -values[j];

}

if (Math.abs(diff) < min) {

min = Math.abs(diff);

value = i;

}

}

/*

* 将上述计算得到的value值，与二进制表示相比较

*

* 1. value & (1 << j)) =