473-Matchsticks to Square

Description

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.

---

问题描述

对卖火柴的小女孩这个故事还有印象么？现在你知道小女孩有多少根火柴， 找出一种方式， 使用所有的火柴做出一个正方形。你不能这段折断任意一个火柴， 但是你可以将它们拼接起来， 并且每一个火柴只能使用一次。

输入为小女孩拥有的火柴， 数字代表它们的长度。输出为true或者false， 代表你是否能使用所有的火柴拼出一个正方形

---

问题分析

回溯法， 为了提高效率， 需要注意几点

1. 对数组排序， 逆序遍历
2. 对选中过的元素进行标记， 解法中直接就地标记， 使用-nums[i]

---

解法

public class Solution {
    public boolean makesquare(int[] nums) {
        if(nums.length == 0) return false;
        //先对元素排序
        Arrays.sort(nums); 

        int sum = 0;
        for(int num : nums) sum += num;

        if(sum % 4 != 0) return false;
        int edgeLen = sum / 4;
        //找出四个划分
        for(int i = 0; i < 4; i++) {
            //逆序遍历
            int start = nums.length - 1;
            //若任意一个划分不满足， 则返回false
            if(!findEdge(nums, edgeLen, start)) return false;
        }
        return true;
    }

    private boolean findEdge(int[] nums, int remain, int start) {
        if (remain == 0)    return true;
        else if(remain < 0) return false;

        for(int i = start; i >= 0; i--){
            if(nums[i] > 0) {
                //注意这里
                nums[i] = -nums[i];
                if(findEdge(nums, remain + nums[i], i - 1))    return true;
                //注意这里
                else    nums[i] = -nums[i];
            }
        }

        return false;
    }
}