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.

很有意思的一道题目。做完之后对DFS又有了更深的了解。对sum[i]来说，如果加上nums[index]还是小于target，就将nums[index]放到sum[i]中。

对nums进行递减排序可以有效的减少遍历次数。

public class Solution {
    public boolean makesquare(int[] nums) {
        if (nums == null || nums.length < 4) return false;
        int l=0;
        boolean flag=true;
        for(int s:nums){
            l+=s;
        }
        if(l%4==0){
            l=l/4;
        }else
            return false;
        Arrays.sort(nums);
        reverse(nums);
        return helper(nums,new int[4],0,l);

    }
    public boolean helper(int[] nums,int[] sum,int index,int target){
        if(index==nums.length){
            if(sum[0]==target&&sum[1]==target&&sum[2]==target&&sum[3]==target) return true;
            return false;
        }
        for(int i=0;i<4;i++){
            if(sum[i]+nums[index]>target) continue;
            sum[i]+=nums[index];
            if(helper(nums,sum,index+1,target)) return true;
            sum[i]-=nums[index];
        }
        return false;
    }
    public 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--;
        }
    }
}