๋ฐ์ํ
[LeetCode - Daily Challenge] 764. Largest Plus Sign
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem You are given an integer n. You have an n x n binary grid grid with all values initially 1's except for some indices given in the array mines. The ith element of the array mines is defined as mines[i] = [xi, yi] where grid[xi][yi] == 0. Return the order of the largest axis-aligned plus sign of 1's contained in grid. If there is none, return 0. An axis..
Algorithm/LeetCode Daily Challenge
2021. 9. 10. 10:42
๋ฐ์ํ
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 105,853
- Today
- 47
- Yesterday
- 392
๋งํฌ
TAG
- Spring Data JPA
- ์๊ณ ๋ฆฌ์ฆ
- JSON
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- ํจ๊ป ์๋ผ๊ธฐ
- Spring Boot JPA
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ
- spring boot application
- ์คํ๋ง๋ถํธ
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- spring boot jwt
- ํฅ์ฌ๊ณ ๋ ์ํคํ ์ฒ
- proto3
- spring boot app
- JPA
- intellij
- Linux
- Jackson
- ํด๋ฆฐ ์ํคํ ์ฒ
- Spring Boot Tutorial
- ํจ๊ป ์๋ผ๊ธฐ ํ๊ธฐ
- ์คํ๋ง ๋ถํธ
- Java
- Spring Boot
- gRPC
- @ManyToOne
- r
- leetcode
- QueryDSL
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์