728x90
๋ฐ์ํ
[LeetCode - Daily Challenge] 331. Verify Preorder Serialization of a Binary Tree
Problem One way to serialize a binary tree is to use preorder traversal. When we encounter a non-null node, we record the node's value. If it is a null node, we record using a sentinel value such as '#'. For example, the above binary tree can be serialized to the string "9,3,4,#,#,1,#,#,2,#,6,#,#", where '#' represents a null node. Given a string of comma-separated values pre..
Algorithm/LeetCode Daily Challenge
2021. 8. 27. 10:30
728x90
๋ฐ์ํ
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 71,750
- Today
- 113
- Yesterday
- 133
๋งํฌ
TAG
- Linux
- ์คํ๋ง ๋ถํธ
- QueryDSL
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- Spring Boot
- Jackson
- ์คํ๋ง๋ถํธ
- JSON
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- ์๊ณ ๋ฆฌ์ฆ
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- leetcode
- ์คํ๋ง ๋ถํธ jwt
- gRPC
- r
- leetcode binary search
- spring boot application
- Java
- intellij
- spring boot app
- ์คํ๋ง ๋ถํธ ์น ์ ํ๋ฆฌ์ผ์ด์
- Spring Data JPA
- JPA
- spring boot jwt
- Spring Boot Tutorial
- leetcode stack
- proto3
- ๋๋ฉ์ธ ์ค๊ณ
- leetcode bst
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ