๋ฐ์ํ
[LeetCode - Daily Challenge] 130. Surrounded Regions
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given an m x n matrix board containing 'X' and 'O', capture all regions that are 4-directionally surrounded by 'X'. A region is captured by flipping all 'O's into 'X's in that surrounded region. Example 1: Input: board = [["X","X","X","X"],["X","O","O","X"],["X","X","O","X"],["X","O","X","X"]] Output: [["X","X","X","X"]..
Algorithm/LeetCode Daily Challenge
2021. 11. 1. 14:33
๋ฐ์ํ
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 105,550
- Today
- 136
- Yesterday
- 186
๋งํฌ
TAG
- Spring Data JPA
- ์๊ณ ๋ฆฌ์ฆ
- @ManyToOne
- Linux
- proto3
- leetcode
- JSON
- ํด๋ฆฐ ์ํคํ ์ฒ
- gRPC
- spring boot app
- Spring Boot Tutorial
- Spring Boot JPA
- QueryDSL
- ์คํ๋ง๋ถํธ
- ํจ๊ป ์๋ผ๊ธฐ
- Jackson
- spring boot jwt
- ์คํ๋ง ๋ถํธ
- JPA
- spring boot application
- r
- ํจ๊ป ์๋ผ๊ธฐ ํ๊ธฐ
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- intellij
- Spring Boot
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- ํฅ์ฌ๊ณ ๋ ์ํคํ ์ฒ
- Java