473. Matchsticks to Square

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

点击打开链接

链接里的解法：题意是给一个数组，试图将它化成4个子集，每个子集的和都是原集合的和的1/4.划分问题原来是NP完全问题，这里因为array的总个数不会超过15，因此dfs可行。事先对原数组按递减排序可以提高速度，因为对于较大的数先进行考虑，可以让不符合的情况快速找出并返回。

class Solution {
    bool dfs(vector<int>& nums,vector<int> & sum, int target,int index)
    {
        if(index==nums.size())
        {
            if(sum[0]==target && sum[1]==target && sum[2]==target)
            return 1;
            return 0;
        }
        
        for(int i=0;i<4;i++)
        {
            if(sum[i]+nums[index]>target) continue;
            sum[i]+=nums[index];
            if(dfs(nums,sum,target,index+1)) return 1;
            sum[i]-=nums[index];
        }
        return 0;
    }
public:
    bool makesquare(vector<int>& nums) {
       int n=nums.size(),sum=0;
       if(n<4) return 0;
       for(auto num:nums)
       sum+=num;
       if(sum%4) return 0;
       int i,target=sum/4;
       sort(nums.begin(),nums.end(),greater<int>());
       vector<int> sums(4,0);
       return dfs(nums,sums,target,0);
       
    }
};