题解 | 分割等和子集

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextInt()) { // 注意 while 处理多个 case
            int a = in.nextInt();
            int[] da = new int[a];
            int total = 0;
            for (int i = 0; i < a; i++) {
                da[i] = in.nextInt();
                total = total +  da[i];
            }
            if (total % 2 == 1) {
                System.out.println(false);
                return;
            }
            int sub = total / 2;
            int[] subArr = new int[sub + 1];
            subArr[0] = 0;
            for (int i : da) {
                for (int j = sub; j >= i; j--) {
                    subArr[j] = Math.max(subArr[j], subArr[j - i] + i);
                }
            }
            System.out.println(subArr[sub] == sub);

        }
    }
}