2021/10/17 글 목록

728x90

[LeetCode - Daily Challenge] 279. Perfect Squares

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem 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: ..

Algorithm/LeetCode Daily Challenge 2021. 10. 17. 10:30

728x90