diff --git "a/leetcode3/\354\265\234\354\233\220\354\244\200/1348. Tweet Counts Per Frequency.py" "b/leetcode3/\354\265\234\354\233\220\354\244\200/1348. Tweet Counts Per Frequency.py" new file mode 100644 index 00000000..d0147423 --- /dev/null +++ "b/leetcode3/\354\265\234\354\233\220\354\244\200/1348. Tweet Counts Per Frequency.py" @@ -0,0 +1,65 @@ +# + +''' +1. 아이디어 : +시간들을 정렬한 후, 이분탐색을 통해 시작점, interval 끝점 - 시작점 갯수로 카운 + +2. 시간복잡도 : + O(nlogn, nlogn) x 10**4 + +3. 자료구조/알고리즘 : +이분탐색, 정 + +''' +class TweetCounts: + + def bs_left(self, nums, target): + left, right = 0, len(nums) + + while left < right: + mid = (left + right) // 2 + + if nums[mid] < target: + left = mid + 1 + else: + right = mid + return left + + def bs_right(self, nums, target): + left, right = 0, len(nums) + + while left < right: + mid = (left + right) // 2 + + if nums[mid] <= target: + left = mid + 1 + else: + right = mid + return left + + def __init__(self): + self.tweets = defaultdict(list) + self.freqs = {"minute":60, "hour":3600, "day":86400} + + def recordTweet(self, tweetName: str, time: int) -> None: + self.tweets[tweetName].append(time) + self.tweets[tweetName].sort() + + def getTweetCountsPerFrequency(self, freq: str, tweetName: str, startTime: int, endTime: int) -> list[int]: + times = self.tweets[tweetName] + ans = [] + + for start in range(startTime, endTime + 1, self.freqs[freq]): + end = min(start + self.freqs[freq] - 1, endTime) + + counts = self.bs_right(times, end) - self.bs_left(times, start) + ans.append(counts) + return ans + + + + +# Your TweetCounts object will be instantiated and called as such: +# obj = TweetCounts() +# obj.recordTweet(tweetName,time) +# param_2 = obj.getTweetCountsPerFrequency(freq,tweetName,startTime,endTime) diff --git "a/leetcode3/\354\265\234\354\233\220\354\244\200/1536. Minimum Swaps to Arrange a Binary Grid.py" "b/leetcode3/\354\265\234\354\233\220\354\244\200/1536. Minimum Swaps to Arrange a Binary Grid.py" new file mode 100644 index 00000000..ac602819 --- /dev/null +++ "b/leetcode3/\354\265\234\354\233\220\354\244\200/1536. Minimum Swaps to Arrange a Binary Grid.py" @@ -0,0 +1,48 @@ +# + +''' +1. 아이디어 : +각 row에 대해 오른쪽부터 연속된 0이 몇개인지 리스트로 유지한 후, +필요한 0의 갯수만큼 swap한다 + +2. 시간복잡도 : + O(n*n + n*n) + +3. 자료구조/알고리즘 : +greedy + +''' +class Solution: + def minSwaps(self, grid: list[list[int]]) -> int: + n = len(grid) + + zeros = [] + + for row in range(n): + zero = 0 + for col in range(n-1, -1, -1): + if grid[row][col] == 1: + break + zero += 1 + + zeros.append(zero) + + ans = 0 + + for i in range(n): + needed = n - i - 1 + + j = i + + while j < n and zeros[j] < needed: + j += 1 + + if j == n: + return -1 + + while j > i: + zeros[j], zeros[j-1] = zeros[j-1], zeros[j] + j -= 1 + ans += 1 + + return ans