LeetCode Top 100 Liked Questions 279. Perfect Squares (Java版; Medium)
题目描述
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.
Example 1:
Input: n = 12
Output: 3
Explanation: 12 = 4 + 4 + 4.
Example 2:
Input: n = 13
Output: 2
Explanation: 13 = 4 + 9.
LeetCode Top 100 Liked Questions 279. Perfect Squares (Java版; Medium)
welcome to my blogLeetCode Top 100 Liked Questions 279. Perfect Squares (Java版; Medium)题目描述Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ......