leetcode 473. Matchsticks to Square

原题目：
Remember the story of Little Match Girl? By now, you know exactly what matchsticks the little match girl has, please find out a way you can make one square by using up all those matchsticks. You should not break any stick, but you can link them up, and each matchstick must be used exactly one time.

Your input will be several matchsticks the girl has, represented with their stick length. Your output will either be true or false, to represent whether you could make one square using all the matchsticks the little match girl has.

Example 1:

Input: [1,1,2,2,2]
Output: true

Explanation: You can form a square with length 2, one side of the square came two sticks with length 1.

Example 2:

Input: [3,3,3,3,4]
Output: false

Explanation: You cannot find a way to form a square with all the matchsticks.

Note:

The length sum of the given matchsticks is in the range of 0 to 10^9.
The length of the given matchstick array will not exceed 15.

你可以在网上看到 https://en.wikipedia.org/wiki/Partition_problem说明， 给我们一个正数集合，让我们求分割成几个相同和的子集合，这是一个典型的 NP问题。
1. 第一眼看到这个题目时候，会想到使用DP来做。后来仔细看了题目数据集约束，
2. The length sum of the given matchsticks is in the range of 0 to 10^9.
The length of the given matchstick array will not exceed 15
似乎数据量不是太大，使用深度优先搜索也可能呢？

没想到真的通过了。

public class Solution {
    public boolean makesquare(int[] nums) {
        // 元素少于 4 个 明显不成立
        if (nums == null || nums.length < 4) {
            return false;
        }
        int sum = 0;
        for (int num : nums) {
            sum += num;
        }
        // 和不能被4整除，明显不成立
        if (sum % 4 != 0) {
            return false;
        }
        // 那就搜索吧
        return dfs(nums, new int[4], 0, sum / 4);
    }

    private boolean dfs(int[] nums, int[] sums, int index, int target) {
        if (index == nums.length) { // 如果搜索到最后
            if (sums[0] == target && sums[1] == target && sums[2] == target) {
                return true;// 只有四条边的长度相等 才return true;
            }
            return false;
        }

        for (int i = 0; i < 4; i++) {
            // 如果不符合要求的 continue
            if (sums[i] + nums[index] > target) {
                continue;
            }
            sums[i] += nums[index];
            // 在下个位置 在进行搜索
            if (dfs(nums, sums, index + 1, target)) {
                return true;
            }
            // 剪枝操作
            sums[i] -= nums[index];
        }

        return false;
    }
}