APS排产相关的leetcode

scheduling相关对应顺序和资源选择

1834 Single-Threaded CPU

class Solution:
    def getOrder(self, tasks: List[List[int]]) -> List[int]:
        for i, task in enumerate(tasks):
            task.append(i)
        tasks.sort()
        ans = []
        q = []
        n = len(tasks)
        i = t = 0
        while q or i < n:
            if not q:
                t = max(t, tasks[i][0])
            while i < n and tasks[i][0] <= t:
                heappush(q, (tasks[i][1], tasks[i][2]))
                i += 1
            pt, j = heappop(q)
            ans.append(j)
            t += pt
        return ans

621 Task Scheduler

630 Course Schedule III

1029 Two City Scheduling

1229 Meeting Scheduler

2365 Task Scheduler II

1335 Minimum Difficulty of a Job Schedule

1462 Course Schedule IV

207 Course Schedule

210 Course Schedule II

815 Bus Routes

1235 Maximum Profit in Job Scheduling

interval相关对应排产中的资源日历选择

759 Employee Free Time

435 Non-overlapping Intervals

class Solution:
    def eraseOverlapIntervals(self, intervals: List[List[int]]) -> int:
        intervals.sort(key=lambda x: x[0])

        finals = []
        res = 0
        for interval in intervals:
            if not finals or interval[0] >= finals[-1][1]:
                finals.append(interval)
            else:
                res += 1
                finals[-1][1] = min(finals[-1][1], interval[1])
        return res