728x90
๋ฐ์ํ
99. Recover Binary Search Tree
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem You are given the root of a binary search tree (BST), where the values of exactly two nodes of the tree were swapped by mistake. Recover the tree without changing its structure. Example 1: Input: root = [1,3,null,null,2] Output: [3,1,null,null,2] Explanation: 3 cannot be a left child of 1 because 3 > 1. Swapping 1 and 3 makes the BST valid.Example 2: Input: r..
Algorithm/LeetCode Daily Challenge
2022. 5. 7. 10:30
728x90
๋ฐ์ํ
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 83,835
- Today
- 55
- Yesterday
- 439
๋งํฌ
TAG
- @ManyToOne
- Spring Boot Tutorial
- leetcode
- leetcode bst
- spring boot application
- Spring Data JPA
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ
- spring boot app
- Spring Boot JPA
- ์คํ๋ง ๋ถํธ
- ์คํ๋ง ๋ถํธ jwt
- leetcode stack
- JPA
- ์๊ณ ๋ฆฌ์ฆ
- spring boot jwt
- QueryDSL
- Jackson
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- intellij
- Java
- r
- gRPC
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- ์คํ๋ง๋ถํธ
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- proto3
- JSON
- leetcode binary search
- Linux
- Spring Boot