記錄了初步解題思路 以及本地實現代碼；并不一定為最優 也希望大家能一起探討 一起進步

---

7/7 1353. 最多可以參加的會議數目

將會議按照開始時間從小到大分組 在組內盡量選擇結束日期早的選擇

def maxEvents(events):""":type events: List[List[int]]:rtype: int"""import heapqmx=max(e[1] for e in events)grp=[[] for _ in range(mx+1)]for e in events:grp[e[0]].append(e[1])ans=0h=[]for i,g in enumerate(grp):while h and h[0]<i:heapq.heappop(h)for end in g:heapq.heappush(h, end)if h:ans+=1heapq.heappop(h)return ans

---

7/8 1751. 最多可以參加的會議數目 II

根據結束時間先后排序
dp[i][j]表示前i個會議選擇j個最大價值和
i不參加
dp[i][j]=dp[i-1][j]
i參加 假設在[1,starti-1]內有p個會議
dp[i][j]=dp[p][j-1]+value
二分查找結束時間早于starti的會議數目

def maxValue(events, k):""":type events: List[List[int]]:type k: int:rtype: int"""import bisectevents.sort(key=lambda x:x[1])n=len(events)dp=[[0]*(k+1) for _ in range(n+1)]for i,(start,end,v) in enumerate(events):p=bisect.bisect_left(events, start,hi=n-1,key=lambda x:x[1])for j in range(1,k+1):dp[i+1][j]=max(dp[i][j],dp[p][j-1]+events[i][2])return dp[n][k]

---

7/9 3439. 重新安排會議得到最多空余時間 I

轉換為合并相鄰的k+1個空余時間塊
滑動長度為k+1的窗口

def maxFreeTime(eventTime, k, startTime, endTime):""":type eventTime: int:type k: int:type startTime: List[int]:type endTime: List[int]:rtype: int"""n=len(startTime)free=[0]*(n+1)free[0]=startTime[0]free[-1]=eventTime-endTime[-1]for i in range(1,n):free[i]=startTime[i]-endTime[i-1]ans=0cur=0for i,f in enumerate(free):cur+=fif i<k:continueans=max(ans,cur)cur-=free[i-k]return ans

---

7/10 3440. 重新安排會議得到最多空余時間 II

只能移動一次會議 就是將相鄰的兩個空余時間合并
最理想的情況 兩個空余時間中間的會議可以安排到另一個空余時間內
得到結果就是兩個空余時間相加再加上中間的會議時間
否則只能是兩個空余時間相加
為了判斷是否可以放入會議 記錄前三大的空位

def maxFreeTime(eventTime, startTime, endTime):""":type eventTime: int:type startTime: List[int]:type endTime: List[int]:rtype: int"""n=len(startTime)def find(i):if i==0:return startTime[0]if i==n:return eventTime-endTime[-1]return startTime[i]-endTime[i-1]a,b,c=0,-1,-1for i in range(1,n+1):v=find(i)if v>find(a):a,b,c=i,a,belif b<0 or v>find(b):b,c=i,belif c<0 or v>find(c):c=ians=0for i,(s,e) in enumerate(zip(startTime,endTime)):v=e-sif i!=a and i+1!=a and v<=find(a) or (i!=b and i+1!=b and v<=find(b)) or v<=find(c):ans=max(ans,find(i)+v+find(i+1))else:ans=max(ans,find(i)+find(i+1))return ans

---

7/11 3169. 無需開會的工作日

將開會起始日期從小到大排序 合并重疊的會議
工作日減去開會的天數

def countDays(days, meetings):""":type days: int:type meetings: List[List[int]]:rtype: int"""meetings.sort()l,r=1,0for m in meetings:if m[0]>r:days-=r-l+1l=m[0]r=max(r,m[1])days-=r-l+1return days

---

7/12 1900. 最佳運動員的比拼回合

參考：https://leetcode.cn/problems/the-earliest-and-latest-rounds-where-players-compete/solutions/825860/dpmei-ju-xia-yi-lun-liang-ming-xuan-shou-okfu/?envType=daily-question&envId=2025-07-12

def earliestAndLatest(n, firstPlayer, secondPlayer):""":type n: int:type firstPlayer: int:type secondPlayer: int:rtype: List[int]"""if firstPlayer + secondPlayer == n + 1:return [1, 1]if firstPlayer + secondPlayer > n + 1:firstPlayer, secondPlayer = n + 1 - secondPlayer, n + 1 - firstPlayerdef calc_earliest_rounds(n):res = 1if firstPlayer + secondPlayer <= (n + 1) // 2:while firstPlayer + secondPlayer <= (n + 1) // 2:res += 1n = (n + 1) // 2if secondPlayer - firstPlayer > 1:return res + 1if secondPlayer - firstPlayer == 1:res += 1n = (n + 1) // 2while n % 2 > 0:res += 1n = (n + 1) // 2return resif secondPlayer <= (n + 1) // 2:return res + 1if secondPlayer - firstPlayer == 2:res += 1n = (n + 1) // 2while n % 2 > 0:res += 1n = (n + 1) // 2return resif firstPlayer % 2 == 0 and firstPlayer + secondPlayer == n:res += 1return res + 1earliest = calc_earliest_rounds(n)latest = min((n - 1).bit_length(), n + 1 - secondPlayer)return [earliest, latest]

---

7/13 2410. 運動員和訓練師的最大匹配數

運動員和訓練師從大到小排列 雙指針依次比較
如果當前最大訓練師無法訓練 當前運動員必定訓練不了 考慮下一個運動員

def matchPlayersAndTrainers(players, trainers):""":type players: List[int]:type trainers: List[int]:rtype: int"""players.sort(reverse=True)trainers.sort(reverse=True)i,j=0,0ans=0while i<len(players) and j<len(trainers):if players[i]<=trainers[j]:ans+=1i+=1j+=1else:i+=1return ans

---