728x90
๋ฐ์ํ
1026. Maximum Difference Between Node and Ancestor
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given the root of a binary tree, find the maximum value v for which there exist different nodes a and b where v = |a.val - b.val| and a is an ancestor of b. A node a is an ancestor of b if either: any child of a is equal to b or any child of a is an ancestor of b. Example 1: Input: root = [8,3,10,1,6,null,14,null,null,4,7,13] Output: 7 Explanation: We have va..
Algorithm/LeetCode Daily Challenge
2022. 1. 2. 10:30
728x90
๋ฐ์ํ
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 71,750
- Today
- 113
- Yesterday
- 133
๋งํฌ
TAG
- spring boot application
- JSON
- Spring Boot Tutorial
- spring boot app
- ์คํ๋ง ๋ถํธ ์น ์ ํ๋ฆฌ์ผ์ด์
- ์คํ๋ง ๋ถํธ jwt
- gRPC
- Spring Data JPA
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ
- ์คํ๋ง ๋ถํธ
- ์๊ณ ๋ฆฌ์ฆ
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- leetcode binary search
- intellij
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- proto3
- ๋๋ฉ์ธ ์ค๊ณ
- leetcode
- spring boot jwt
- Java
- Linux
- Spring Boot
- ์คํ๋ง๋ถํธ
- leetcode stack
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- leetcode bst
- Jackson
- JPA
- QueryDSL
- r