Package g0401_0500.s0473_matchsticks_to_square

Class Solution

java.lang.Object

g0401_0500.s0473_matchsticks_to_square.Solution

public class Solution
extends Object

473 - Matchsticks to Square.<p>Medium</p> <p>You are given an integer array <code>matchsticks</code> where <code>matchsticks[i]</code> is the length of the <code>i^th</code> matchstick. You want to use <strong>all the matchsticks</strong> to make one square. You <strong>should not break</strong> any stick, but you can link them up, and each matchstick must be used <strong>exactly one time</strong>.</p> <p>Return <code>true</code> if you can make this square and <code>false</code> otherwise.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/04/09/matchsticks1-grid.jpg" alt="" /></p> <p><strong>Input:</strong> matchsticks = [1,1,2,2,2]</p> <p><strong>Output:</strong> true</p> <p><strong>Explanation:</strong> You can form a square with length 2, one side of the square came two sticks with length 1.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> matchsticks = [3,3,3,3,4]</p> <p><strong>Output:</strong> false</p> <p><strong>Explanation:</strong> You cannot find a way to form a square with all the matchsticks.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= matchsticks.length <= 15</code></li> <li><code>1 <= matchsticks[i] <= 10⁸</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
boolean	makesquare(int[] matchsticks)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

makesquare

public boolean makesquare(int[] matchsticks)