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
35 changes: 35 additions & 0 deletions leetcode3/변지협/v4/1733. Minimum Number of People to Teach.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,35 @@
from collections import defaultdict
class Solution:
def minimumTeachings(self, n: int, languages: list[list[int]], friendships: list[list[int]]) -> int:
tmp = []
for a,b in friendships:
tmp.append((a-1,b-1))

dic = defaultdict(list)

for a,b in tmp:
a_lan = set(languages[a])
b_lan = set(languages[b])

overlap = a_lan & b_lan
if not overlap:
dic[a].append(b)
dic[b].append(a)

print(dic)

for i in range(n):
most_freq = defaultdict(int)
for friend in dic[i]:
for j in languages[i]:
most_freq[j] += 1

most_freq = sorted(most_freq.items(), key=lambda x:x[1], reverse=True)

for key,value in most_freq:


print(most_freq)



20 changes: 20 additions & 0 deletions leetcode3/변지협/v4/3857. Minimum Cost to Split into Ones.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
class Solution:
def minCost(self, n: int) -> int:
dic = {}
dic[1] = 0
dic[2] = 1
dic[3] = 3
dic[4] = 6

for i in range(5,n+1):
a = 1
b = i - 1
tmp = 10e9
while a < b:
tmp = min(tmp, a * b + dic[a] + dic[b])
a+=1
b-=1
dic[i] = tmp

return dic[n]

Loading