보호되어 있는 글입니다.

from collections import deque class Solution: def numIslands(self, grid: List[List[str]]) -> int: islands = 0 M = len(grid) N = len(grid[0]) visited = [[False] * N for _ in range(M)] def bfs(x, y): dx = [-1, 0, 0, 1] dy = [0, -1, 1, 0] visited[x][y] = True q = deque() q.append((x, y)) while q: cur_x, cur_y = q.popleft() for i in range(4): nx, ny = cur_x + dx[i], cur_y + dy[i] if nx >= 0 and nx <..

보호되어 있는 글입니다.

class Solution: def findDisappearedNumbers(self, nums: List[int]) -> List[int]: temp = set(range(1,len(nums)+1)) answer = temp - set(nums) return answer

class Solution: def thirdMax(self, nums: List[int]) -> int: nums = set(nums) nums = sorted(nums, reverse=True) if len(nums) < 3: answer = nums[0] else: answer = nums[2] return answer

class Solution: def heightChecker(self, heights: List[int]) -> int: new_h = sorted(heights) match = 0 for i in range(len(heights)): if heights[i] != new_h[i]: match += 1 return match