Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
40 changes: 40 additions & 0 deletions leetcode3/오은혁/1348. Tweet Counts Per Frequency
Original file line number Diff line number Diff line change
@@ -0,0 +1,40 @@
class TweetCounts:

def __init__(self):
self.tweets={}
self.time_dict={"minute":60,"hour":3600,"day":86400}


def recordTweet(self, tweetName: str, time: int) -> None:
if tweetName in self.tweets:

self.tweets[tweetName].append(time)
else:
self.tweets[tweetName]=[time]


def getTweetCountsPerFrequency(self, freq: str, tweetName: str, startTime: int, endTime: int) -> list[int]:
self.ans=[]

while startTime<=endTime:
cnt=0
for a in self.tweets[tweetName]:
if a>=startTime and a<=startTime+self.time_dict[freq]-1:
cnt+=1
self.ans.append(cnt)


startTime+=self.time_dict[freq]
return self.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)
32 changes: 32 additions & 0 deletions leetcode3/오은혁/1536. Minimum Swaps to Arrange a Binary Grid
Original file line number Diff line number Diff line change
@@ -0,0 +1,32 @@
class Solution:

def is_poss(self,grid,y,need):
for x in range(len(grid)-need,len(grid) ):
if grid[y][x]==1:return False
return True
def swap(self,grid,a,b):
temp=grid[a]
grid[a]=grid[b]
grid[b]=temp



def minSwaps(self, grid: list[list[int]]) -> int:
n=len(grid)
ans=0
for y in range(n):
need=n-(y+1)
target=-1
for ny in range(y,n):
if self.is_poss(grid,ny,need):
target=ny
break
if target==-1:return -1
while target>y:
ans+=1
self.swap(grid,target,target-1)
target-=1

return ans


18 changes: 18 additions & 0 deletions leetcode3/오은혁/1696. Jump Game VI
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
import heapq
class Solution:
def maxResult(self, nums: list[int], k: int) -> int:
hq=[]
dp=[0]*len(nums)
dp[0]=nums[0]
heapq.heappush(hq,(-dp[0],0))
for i in range(1,len(nums)):
while hq and hq[0][1]<i-k:

heapq.heappop(hq)



dp[i]=-hq[0][0]+nums[i]
heapq.heappush(hq,(-dp[i],i))
return dp[-1]