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:

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.

给定一组火柴盒对应的长度，求问用这些火柴能否组成一个正方形。一开始想尝试通过判断火柴长度之和能否分成1：3和2：2来确定火柴能否组成正方形，但是这样的判断是错误的，例如[2，1，3，2]这一组就可以满足要求，但是它们不能组成正方形。所以这道题必须构造正方形的四条边让每条边的长度都等于火柴长度之和的四分之一，这样才能确定一个正方形。

class Solution {
public:
    bool makesquare(vector<int>& nums) {
        int n=nums.size();
        if(n<4) return false;
        int sum=0;
        for(int i=0;i<n;i++) sum+=nums[i];
        if(sum%4>0) return false;
        int len=sum/4;
        sort(nums.begin(),nums.end());
        vector<int> edges(4,0);
        return makesquare_recur(nums,n-1,len,edges);
    }
    
    bool makesquare_recur(vector<int> nums, int index, int len, vector<int> edges)
    {
        if(index==-1)
        {
            if(edges[0]==len&&edges[1]==len&&edges[2]==len&&edges[3]==len) return true;
            else return false;
        }
        for(int i=0;i<4;i++)
        {
            if(edges[i]+nums[index]<=len)
            {
                edges[i]+=nums[index];
                if(makesquare_recur(nums,index-1,len,edges)) return true;
                edges[i]-=nums[index];
            }
        }
        return false;
    }
};