Commit 4576de1

committed

[20220814] 306 contest 참가

1 parent c7582f2 commit 4576de1Copy full SHA for 4576de1

File tree

+79

-0

lines changed

+79

-0

lines changed

Lines changed: 27 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,27 @@`
	`1`	`+# https://leetcode.com/contest/weekly-contest-306/problems/largest-local-values-in-a-matrix/`
	`2`	`+from typing import List`
	`3`	`+`
	`4`	`+`
	`5`	`+class Solution:`
	`6`	`+ def largestLocal(self, grid: List[List[int]]) -> List[List[int]]:`
	`7`	`+`
	`8`	`+ result = []`
	`9`	`+ for i in range(0, len(grid) - 2):`
	`10`	`+ inner = []`
	`11`	`+ for j in range(0, len(grid[i]) - 2):`
	`12`	`+ mv = 0`
	`13`	`+ for p in range(3):`
	`14`	`+ for q in range(3):`
	`15`	`+ mv = max(mv, grid[i + p][j + q])`
	`16`	`+ inner.append(mv)`
	`17`	`+ result.append(inner)`
	`18`	`+ return result`
	`19`	`+`
	`20`	`+`
	`21`	`+if __name__ == '__main__':`
	`22`	`+ sol = Solution()`
	`23`	`+ grid = [[9, 9, 8, 1], [5, 6, 2, 6], [8, 2, 6, 4], [6, 2, 2, 2]]`
	`24`	`+ print(sol.largestLocal(grid))`
	`25`	`+`
	`26`	`+ grid2 = [[1, 1, 1, 1, 1], [1, 1, 1, 1, 1], [1, 1, 2, 1, 1], [1, 1, 1, 1, 1], [1, 1, 1, 1, 1]]`
	`27`	`+ print(sol.largestLocal(grid2))`

Lines changed: 27 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,27 @@`
	`1`	`+# https://leetcode.com/contest/weekly-contest-306/problems/node-with-highest-edge-score/`
	`2`	`+from typing import List`
	`3`	`+`
	`4`	`+`
	`5`	`+class Solution:`
	`6`	`+ def edgeScore(self, edges: List[int]) -> int:`
	`7`	`+ graph = [0 for _ in range(len(edges))]`
	`8`	`+`
	`9`	`+ for i in range(len(edges)):`
	`10`	`+ graph[edges[i]] += i`
	`11`	`+`
	`12`	`+ cur_max = -1`
	`13`	`+ cur_node = -1`
	`14`	`+ for i in range(len(graph)):`
	`15`	`+ if cur_max < graph[i]:`
	`16`	`+ cur_max = graph[i]`
	`17`	`+ cur_node = i`
	`18`	`+ elif cur_max == graph[i]:`
	`19`	`+ cur_node = min(cur_node, i)`
	`20`	`+`
	`21`	`+ return cur_node`
	`22`	`+`
	`23`	`+`
	`24`	`+if __name__ == '__main__':`
	`25`	`+ sol = Solution()`
	`26`	`+ print(sol.edgeScore([1, 0, 0, 0, 0, 7, 7, 5]))`
	`27`	`+ print(sol.edgeScore([2, 0, 0, 2]))`

Lines changed: 25 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,25 @@`
	`1`	`+## Weekly Contest 306`
	`2`	`+`
	`3`	`+https://leetcode.com/contest/weekly-contest-306/`
	`4`	`+`
	`5`	`+### 2373. Largest Local Values in a Matrix`
	`6`	`+`
	`7`	`+문제가 뭐라고 하는지 몰라서 살짝 당황했다.`
	`8`	`+단순 구현 문제였는데 멘탈이 털리면 바로 못 풀것 같은 그런 문제였음`
	`9`	`+`
	`10`	`+### 2374. Node With Highest Edge Score`
	`11`	`+`
	`12`	`+자주 풀어봤던 그래프 문제로 1번 보다 쉬웠다.`
	`13`	`+`
	`14`	`+### 2375. Construct Smallest Number From DI String`
	`15`	`+`
	`16`	`+이 문제 그리디로 하면 될 것 같긴한데 아이디어가 생각이 안남`
	`17`	`+`
	`18`	`+> 그리디는 진짜 뇌지컬이 중요한듯`
	`19`	`+`
	`20`	`+앞에서부터 작은 값을 채워넣으면 된다고 생각했는데 예외처리가 까다로웠음`
	`21`	`+이런 문제 릿코드에서 종종 봤는데, 그 떄 마다 풀때도 있고 못 풀 때도 있어서 제대로 좀 해봐야겠다고 생각이 듦`
	`22`	`+`
	`23`	`+## 결과`
	`24`	`+`
	`25`	`+1번, 2번 두개 풀어서 총점 7 점`

Comments

(0)