> For the complete documentation index, see [llms.txt](https://protegejj.gitbook.io/algorithm-practice/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://protegejj.gitbook.io/algorithm-practice/leetcode/backtracking/473-matchsticks-to-square.md).

# 473 Matchsticks to Square

## 473. [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square/description/)

## 1. Question

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`.

## 2. Implementation

**(1) Backtracking**

```java
class Solution {
    public boolean makesquare(int[] nums) {
        if (nums == null || nums.length == 0) {
            return false;
        }

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

        if (sum % 4 != 0) {
            return false;
        }

        Arrays.sort(nums);
        reverse(nums);
        int[] squareEdge = new int[4];
        return recMakeSquare(0, squareEdge, nums, sum / 4);
    }

    public boolean recMakeSquare(int index, int[] squareEdge, int[] nums, int target) {
        if (index == nums.length) {
            return squareEdge[0] == squareEdge[1] && squareEdge[1] == squareEdge[2];
        }

        for (int i = 0; i < 4; i++) {
            if (squareEdge[i] + nums[index] > target) {
                continue;
            }

            squareEdge[i] += nums[index];
            if (recMakeSquare(index + 1, squareEdge, nums, target)) {
                return true;
            }
            squareEdge[i] -= nums[index];
        }
        return false;
    }

    public void reverse(int[] nums) {
        for (int i = 0; i < nums.length / 2; i++) {
            int temp = nums[i];
            nums[i] = nums[nums.length - 1 - i];
            nums[nums.length - 1 - i] = temp;
        }
    }
}
```

## 3. Time & Space Complexity

**Backtracking:** 时间复杂度O(n!) [解析](https://discuss.leetcode.com/topic/72107/java-dfs-solution-with-explanation/16), 空间复杂度O(n)