[LeetCode] Problem 279 - Perfect Squares
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, …) which sum to n.
ExampleNo.1Input: n = 12
Out
...