Package g0201_0300.s0279_perfect_squares

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    279 - Perfect Squares\.

    Medium

    Given an integer n, return the least number of perfect square numbers that sum to n.

    A perfect square is an integer that is the square of an integer; in other words, it is the product of some integer with itself. For example, 1, 4, 9, and 16 are perfect squares while 3 and 11 are not.

    Example 1:

    Input: n = 12

    Output: 3

    Explanation: 12 = 4 + 4 + 4.

    Example 2:

    Input: n = 13

    Output: 2

    Explanation: 13 = 4 + 9.

    Constraints:

    • <code>1 <= n <= 10<sup>4</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 Integer numSquares(Integer n)

      • Methods inherited from class java.lang.Object

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