0/leetcode (18) 썸네일형 리스트형 53. Maximum Subarray 풀이 leetcode.com/problems/maximum-subarray/ Maximum Subarray - 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 # Greedy class Solution: def maxSubArray(self, nums: List[int]) -> int: if not nums : return 0 curr_max = output = nums[0] for i in range(1, len(nums)) : curr_max = max(curr_m.. 139. Word Break 풀이 leetcode.com/problems/word-break/ Word Break - 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 wordBreak(self, s: str, wordDict: List[str]) -> bool: if not s or not wordDict : return False words = set(wordDict) n = len(s) dp = [False]*(n+1) dp[0] = True for end .. 5. Longest Palindromic Substring 풀이 leetcode.com/problems/longest-palindromic-substring/ Longest Palindromic Substring - 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 문제 : 가장 긴 palindromic 한 문자열을 리턴하는 것. 풀이 : 첫 번째는 인덱스를 하나하나 늘려가면서 왼쪽과 오른쪽으로 expanding 해 나가는 방법이 있다. 이때 주의해야 할 점은 palindrome의 길이가 홀수인지 짝수인지 알 수 없기 때문에 두.. [October LeetCoding Challenge] 29th - Maximize Distance to Closest Person leetcode.com/explore/challenge/card/october-leetcoding-challenge/563/week-5-october-29th-october-31st/3512/ Explore - LeetCode LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore. leetcode.com class Solution: def maxDistToClosest(self, seats: List[int]) ->.. 398. Random Pick Index leetcode.com/problems/random-pick-index/ Random Pick Index - 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 __init__(self, nums: List[int]): self.nums = nums def pick(self, target: int) -> int: output = 0 count = 0 for i, x in enumerate(self.nums) : if x != tar.. 388. Longest Absolute File Path leetcode.com/problems/longest-absolute-file-path/ Longest Absolute File Path - 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 lengthLongestPath(self, input: str) -> int: tokens = input.split('\n') if not tokens : return 0 d = collections.defaultdict(int) output.. 914. X of a Kind in a Deck of Cards class Solution: def hasGroupsSizeX(self, deck: List[int]) -> bool: if len(deck) < 2 : return False m = collections.defaultdict(int) for i in deck : m[i] += 1 psize = m[deck[0]] for i in m.values() : psize = self.gcd(psize, i) if psize == 1 : return False return True def gcd(self, a, b) : while b != 0 : n = a % b a = b b = n return a 정리 : 최대 공약수 활용. # 최대공약수 (Greatest Common Divisor)를 구하는 가장 쉬운 방법.. 41. First Missing Positive leetcode.com/problems/first-missing-positive/ First Missing Positive - 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 firstMissingPositive(self, nums: List[int]) -> int: if 1 not in nums : return 1 n = len(nums) for i in range(n) : if nums[i] n : nums[i] = 1 fo.. 이전 1 2 3 다음