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
๋ฐ์ํ
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 71,526
- Today
- 22
- Yesterday
- 397
๋งํฌ
TAG
- r
- spring boot jwt
- JPA
- gRPC
- ๋๋ฉ์ธ ์ค๊ณ
- ์๊ณ ๋ฆฌ์ฆ
- leetcode
- QueryDSL
- ์คํ๋ง ๋ถํธ ์น ์ ํ๋ฆฌ์ผ์ด์
- Spring Boot
- ์คํ๋ง๋ถํธ
- intellij
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- leetcode bst
- Java
- Jackson
- ์คํ๋ง ๋ถํธ jwt
- leetcode binary search
- leetcode stack
- spring boot application
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- proto3
- Linux
- ์คํ๋ง ๋ถํธ
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ
- Spring Data JPA
- spring boot app
- Spring Boot Tutorial
- JSON