๋ฐ์ํ
[LeetCode - Daily Challenge] 85. Maximal Rectangle
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given a rows x cols binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area. Example 1: Input: matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]] Output: 6 Explanation: The maximal rectangle is shown in the above picture. Example 2: Input: matrix = []..
Algorithm/LeetCode Daily Challenge
2021. 11. 30. 10:30
๋ฐ์ํ
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 128,446
- Today
- 24
- Yesterday
- 526
๋งํฌ
TAG
- gRPC
- QueryDSL
- intellij
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- ํฅ์ฌ๊ณ ๋ ์ํคํ ์ฒ
- proto3
- Spring Boot
- leetcode
- @ManyToOne
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- r
- Spring Data JPA
- ํจ๊ป ์๋ผ๊ธฐ
- ์๊ณ ๋ฆฌ์ฆ
- ํจ๊ป ์๋ผ๊ธฐ ํ๊ธฐ
- spring boot application
- JPA
- Linux
- Java
- ์คํ๋ง๋ถํธ
- Spring Boot Tutorial
- JSON
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- spring boot app
- ์คํ๋ง ๋ถํธ
- Spring Boot JPA
- spring boot jwt
- Jackson
- ํด๋ฆฐ ์ํคํ ์ฒ
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ