๋ฐ์ํ
997. Find the Town Judge
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem In a town, there are n people labeled from 1 to n. There is a rumor that one of these people is secretly the town judge. If the town judge exists, then: The town judge trusts nobody. Everybody (except for the town judge) trusts the town judge. There is exactly one person that satisfies properties 1 and 2. You are given an array trust where trust[i] = [ai, bi]..
Algorithm/LeetCode Daily Challenge
2022. 1. 4. 10:30
๋ฐ์ํ
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 181,998
- Today
- 35
- Yesterday
- 551
๋งํฌ
TAG
- ์คํ๋ง๋ถํธ
- r
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ
- ์๊ณ ๋ฆฌ์ฆ
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- ํฅ์ฌ๊ณ ๋ ์ํคํ ์ฒ
- ์คํ๋ง ๋ถํธ
- Spring Boot JPA
- Linux
- @ManyToOne
- QueryDSL
- Spring Boot
- proto3
- ํจ๊ป ์๋ผ๊ธฐ ํ๊ธฐ
- JSON
- Spring Boot Tutorial
- ํด๋ฆฐ ์ํคํ ์ฒ
- spring boot application
- gRPC
- leetcode
- Spring Data JPA
- Jackson
- spring boot jwt
- ํจ๊ป ์๋ผ๊ธฐ
- Java
- JPA
- spring boot app
- intellij
- ์คํ๋ง ๋ฐ์ดํฐ jpa