소프트웨어에 대한 모든 것

559. Maximum Depth of N-ary Tree https://leetcode.com/problems/maximum-depth-of-n-ary-tree/ Maximum Depth of N-ary Tree - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) recursive """ # Definition for a Node. class Node: def __init__(self, val=None, children=None): self.v..

695. Max Area of Island https://leetcode.com/problems/max-area-of-island/ Max Area of Island - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) m x n의 island를 dfs 탐색해 나갑니다. visited 별도의 space를 만들어서 방문했던 곳은 skip 처리합니다. class Solution: def maxAreaOfIsland(self, grid: List[Lis..

1832. Check if the Sentence Is Pangram https://leetcode.com/problems/check-if-the-sentence-is-pangram/ 문제) 솔루션1) 각 알파벳을 해쉬에 저장 sentence에서 문자를 해쉬에서 key 값 서치해서 있으면 삭제 해쉬의 사이즈가 0이면 pangram을 만족하기 때문에 True를 리턴, 아니면 False class Solution: def checkIfPangram(self, sentence: str) -> bool: alphabets = 'abcdefghijklmnopqrstuvwxyz' d = {} for c in alphabets: d[c] = None for c in sentence: if c in d: del d[c..