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:

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

首先对数组排序，深度遍历数组，设立一个int[4] sum数组保存四个边的长度。sum[i] 先加nums[index]，在深度遍历下个数，返回后sum[i]减去nums[index]。如果sum[i] + num[index] >= target，i+1继续看下一个数能不能加nums[index]。代码如下：

public class Solution {
    public boolean makesquare(int[] nums) {
        if (nums.length < 4) {
            return false;
        }
        int sum = 0;
        for (int num: nums) {
            sum += num;
        }
        if (sum % 4 != 0) {
            return false;
        }
        Arrays.sort(nums);
        reverse(nums);
        return DFS(nums, 0, new int[4], sum / 4);
    }
    
    private boolean DFS(int[] nums, int index, int[] sums, int target) {
        if (index == nums.length) {
            if (sums[0] == target && sums[1] == target && sums[2] == target) {
                return true;
            } else {
                return false;
            }
        }
        for (int i = 0; i < 4; i ++) {
            if (sums[i] + nums[index] > target) continue;
            sums[i] += nums[index];
            if (DFS(nums, index + 1, sums, target)) return true;
            sums[i] -= nums[index];
        }
        return false;
    }
    
    private void reverse(int[] nums) {
        int i = 0, j = nums.length - 1;
        while (i < j) {
            int temp = nums[i];
            nums[i] = nums[j];
            nums[j] = temp;
            i ++;
            j --;
        }
    }
}