LeetCode 473. Matchsticks to Square

原题网址：https://leetcode.com/problems/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.

思路：参考：https://discuss.leetcode.com/topic/72107/java-dfs-solution-with-explanation

方法：深度优先搜索，由于要对数字进行分组，而组号并不重要，重要的是区分不同组就行，所以增加一行剪枝“if (step < 4 && i > step) break”可以极大缩短搜索时间。

Java代码：

public class Solution {
    public boolean makesquare(int[] nums) {
        if (nums == null || nums.length < 4) {
            return false;
        }
        int sum = 0;
        for(int num : nums) {
            sum += num;
        }
        if (sum % 4 != 0) {
            return false;
        }
        return find(nums, new int[4], 0, sum / 4);
    }
    private boolean find(int[] nums, int[] sums, int step, int sum) {
        if (step == nums.length) {
            return true;
        }
        for(int i = 0; i < 4; i++) {
            if (sums[i] + nums[step] > sum) continue;
            if (step < 4 && i > step) break;
            sums[i] += nums[step];
            if (find(nums, sums, step + 1, sum)) return true;
            sums[i] -= nums[step];
        }
        return false;
    }
}

C#代码：

public class Solution {
    public bool Makesquare(int[] nums) {
        if (nums == null || nums.Length < 4) return false;
        int sum = 0;
        foreach(int num in nums) {
            sum += num;
        }
        if (sum % 4 != 0) return false;
        return find(nums, new int[4], 0, sum / 4);
    }
    private bool find(int[] nums, int[] sums, int step, int sum) {
        if (step == nums.Length) return true;
        for(int i = 0; i < 4; i++) {
            if (step < 4 && i > step) break;
            if (sums[i] + nums[step] > sum) continue;
            sums[i] += nums[step];
            if (find(nums, sums, step + 1, sum)) return true;
            sums[i] -= nums[step];
        }
        return false;
    }
}