관심있는것들

Sum of Absolute Differences in a Sorted Array

https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array/class Solution: def getSumAbsoluteDifferences(self, nums: List[int]) -> List[int]: total_sum = sum(nums) left_sum = 0 res = [] for i , n in enumerate(nums): right_sum = total_sum - n - left_sum left_size, right_size = i , len(nums) - i -1 res.append( ..

Majority Element II

https://leetcode.com/problems/majority-element-ii/description/class Solution: def majorityElement(self, nums: List[int]) -> List[int]: count = defaultdict(int) for n in nums: count[n] += 1 if len(count) 1: new_count[n] = c - 1 count = new_count res = [] for n in count: if nums.count(n) > len(nums) // 3..

Champagne Tower

https://leetcode.com/problems/champagne-tower/description/class Solution: def champagneTower(self, poured: int, query_row: int, query_glass: int) -> float: prev_row = [poured] # Flow for row in range(1, query_row + 1): cur_row = [0] * (row + 1) for i in range(row): extra = prev_row[i] - 1 if extra > 0: cur_ro..

https://leetcode.com/problems/minimum-penalty-for-a-shop/description/class Solution: def bestClosingTime(self, customers: str) -> int: n = len(customers) prefix_n = [0] * (n + 1) postfix_y = [0] * (n + 1) for i in range(1, n + 1): prefix_n[i] = prefix_n[i-1] if customers[i-1] == "N": prefix_n[i] += 1 for i in range(n - 1,..

보호되어 있는 글입니다.

https://leetcode.com/problems/design-underground-system/description/class UndergroundSystem: def __init__(self): self.checkInMap = {} # id -> (startStation, time) self.totalMap = {} # (start, end) -> [totalTime, count] def checkIn(self, id: int, stationName: str, t: int) -> None: self.checkInMap[id] = (stationName, t) def checkOut(self, id: int, stationName: str, t:..

https://leetcode.com/problems/optimal-partition-of-string/description/class Solution: def partitionString(self, s: str) -> int: curSet = set() res = 1 for c in s: if c in curSet: res += 1 curSet = set() curSet.add(c) else: curSet.add(c) return resuse HashSet to check if substring has ..

https://leetcode.com/problems/number-of-zero-filled-subarrays/description/class Solution: def zeroFilledSubarray(self, nums: List[int]) -> int: i, res = 0, 0 while i int: res, count = 0 ,0 for i in range(len(nums)): if nums[i] == 0: count += 1 else: count = 0 res += count return respoint is as c..

https://leetcode.com/problems/first-missing-positive/description/class Solution: def firstMissingPositive(self, A: List[int]) -> int: for i in range(len(A)): if A[i] 0: A[val -1] *= -1 elif A[val -1] == 0: A[val-1] = -1 * (len(A) + 1) for i in range(1, len(A) + 1): if A[i - 1] >= 0: return..

https://leetcode.com/problems/non-decreasing-array/ class Solution: def checkPossibility(self, nums: List[int]) -> bool: changed = False for i in range(len(nums) - 1): if nums[i] = nums[i-1]: nums[i] = nums[i+1] else: nums[i+1] = nums[i] changed = True return Truewhen considering pair, we can either adjust lef..