https://leetcode.com/problems/maximum-sum-of-an-hourglass/
왜 미디엄인지 모르겠다. 그냥 노가다!
재미로 한줄코딩으로 해봤다.
class Solution:
def maxSum(self, grid: List[List[int]]) -> int:
return max( sum(grid[i][j:j+3]) + sum(grid[i+1][j:j+3]) + sum(grid[i+2][j:j+3]) - grid[i+1][j] - grid[i+1][j+2] for i in range(len(grid)-2) for j in range(len(grid[0])-2) )'코딩 테스트 및 알고리즘 > leetcode for google' 카테고리의 다른 글
| leetcode medium : Minimum Time to Make Rope Colorful (1) | 2022.10.04 |
|---|---|
| leetcode medium : Minimize XOR (2) | 2022.10.03 |
| leetcode easy : Number of Common Factors (0) | 2022.10.03 |
| leetcode hard : 24 Game (0) | 2022.10.03 |
| leetcode medium : Clone Graph (0) | 2022.10.03 |