728x90
반응형
[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
728x90
반응형
1