๋ฐ์ํ
406. Queue Reconstruction by Height
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem You are given an array of people, people, which are the attributes of some people in a queue (not necessarily in order). Each people[i] = [hi, ki] represents the ith person of height hi with exactly ki other people in front who have a height greater than or equal to hi. Reconstruct and return the queue that is represented by the input array people. The return..
Algorithm/LeetCode Daily Challenge
2022. 7. 1. 10:30
๋ฐ์ํ
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 181,998
- Today
- 35
- Yesterday
- 551
๋งํฌ
TAG
- spring boot application
- r
- ํจ๊ป ์๋ผ๊ธฐ ํ๊ธฐ
- leetcode
- intellij
- ํจ๊ป ์๋ผ๊ธฐ
- Spring Boot
- Jackson
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- JPA
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- spring boot app
- ์คํ๋ง ๋ถํธ
- gRPC
- ํด๋ฆฐ ์ํคํ ์ฒ
- proto3
- Spring Boot JPA
- spring boot jwt
- Linux
- Spring Data JPA
- ์๊ณ ๋ฆฌ์ฆ
- ์คํ๋ง๋ถํธ
- ํฅ์ฌ๊ณ ๋ ์ํคํ ์ฒ
- QueryDSL
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ
- @ManyToOne
- JSON
- Spring Boot Tutorial
- Java