어제보다 나은 내가 되기 위한 여정

1025. Divisor Game https://leetcode.com/problems/divisor-game/ Divisor Game - 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 문제를 푸는데 전혀 감이 오지 않아서 고민하다가 바로 Discussion으로 넘어갔다. class Solution: def divisorGame(self, n: int) -> bool: return n % 2 == 0 1. Top-Down 방식 1) n이 짝수일 때 Alice가 ..

338. Counting Bits https://leetcode.com/problems/counting-bits/ Counting Bits - 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 # 나의 코드 class Solution: def countBits(self, n: int) -> List[int]: answer = [] for i in range(n+1): answer.append(bin(i)[2:].count('1')) return answer # Ti..