Package g0401_0500.s0473_matchsticks_to_square

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    473 - Matchsticks to Square.

    Medium

    You are given an integer array matchsticks where matchsticks[i] is the length of the <code>i<sup>th</sup></code> matchstick. You want to use all the matchsticks to make one square. You should not break any stick, but you can link them up, and each matchstick must be used exactly one time.

    Return true if you can make this square and false otherwise.

    Example 1:

    Input: matchsticks = 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: matchsticks = 3,3,3,3,4

    Output: false

    Explanation: You cannot find a way to form a square with all the matchsticks.

    Constraints:

    • 1 &lt;= matchsticks.length &lt;= 15

    • <code>1 <= matchsticksi<= 10<sup>8</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Boolean makesquare(IntArray matchsticks)

      • Methods inherited from class java.lang.Object

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