728x90
๋ฐ์ํ
1302. Deepest Leaves Sum
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given the root of a binary tree, return the sum of values of its deepest leaves. Example 1: Input: root = [1,2,3,4,5,null,6,7,null,null,null,null,8] Output: 15Example 2: Input: root = [6,7,8,2,7,1,3,9,null,1,4,null,null,null,5] Output: 19Constraints: The number of nodes in the tree is in the range [1, 10^4]. 1 test(TreeNode.of(6, 7, 8, 2, 7, 1, 3, 9, null, 1,..
Algorithm/LeetCode Daily Challenge
2022. 5. 27. 10:30
728x90
๋ฐ์ํ
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 83,839
- Today
- 59
- Yesterday
- 439
๋งํฌ
TAG
- JPA
- ์๊ณ ๋ฆฌ์ฆ
- Spring Data JPA
- QueryDSL
- r
- ์คํ๋ง ๋ถํธ jwt
- Spring Boot Tutorial
- ์คํ๋ง ๋ถํธ
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- leetcode
- Jackson
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ
- spring boot app
- proto3
- intellij
- leetcode binary search
- gRPC
- Linux
- Spring Boot JPA
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- ์คํ๋ง๋ถํธ
- leetcode bst
- Spring Boot
- JSON
- Java
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- @ManyToOne
- leetcode stack
- spring boot application
- spring boot jwt