2021-04-30

Author: JiayangWu

1834.单线程CPU/1834-单线程CPU.py

@@ -0,0 +1,34 @@
+class Solution(object):
+    def getOrder(self, tasks):
+        """
+        :type tasks: List[List[int]]
+        :rtype: List[int]
+        """
+        from heapq import *
+        if not tasks:
+            return []
+
+        tasks = [(pair[1], index, pair[0]) for index, pair in enumerate(tasks)] # 打包原始下标
+        tasks.sort(key = lambda x: x[2]) # 按入队时间排序
+
+        next_task_id = 0 # 下一项要干的工作
+        cur_time = tasks[0][2]
+        min_heap = []
+        res = []
+        while next_task_id < len(tasks) or min_heap:
+            while next_task_id < len(tasks) and tasks[next_task_id][2] <= cur_time:
+                # 入队所有已经可以开始干的工作
+                heappush(min_heap, tasks[next_task_id])
+                next_task_id += 1
+
+            # 开始工作
+            if not min_heap:
+                # 直接跳到下一个有效时间
+                cur_time = tasks[next_task_id][2]
+            else:
+                # 工作
+                working_task = heappop(min_heap)
+                cur_time += working_task[0]
+                res.append(working_task[1])
+
+        return res

1837.K进制表示下的各位数字总和/1837-K进制表示下的各位数字总和.py

@@ -0,0 +1,12 @@
+class Solution(object):
+    def sumBase(self, n, k):
+        """
+        :type n: int
+        :type k: int
+        :rtype: int
+        """
+        res = 0
+        while n:
+            res += n % k
+            n //= k
+        return res

1839.所有元音按顺序排布的最长子字符串/1839-所有元音按顺序排布的最长子字符串.py

@@ -0,0 +1,23 @@
+class Solution(object):
+    def longestBeautifulSubstring(self, word):
+        """
+        :type word: str
+        :rtype: int
+        """
+        sequence = {"a":1, "e":2, "i":3, "o":4, "u":5}
+
+        last_vowel = None
+        res = 0
+        start = 0
+        cur_set = set()
+        for i, ch in enumerate(word):
+            if not i or sequence[last_vowel] > sequence[ch]:
+                start = i
+                cur_set = set(ch)
+            else:
+                cur_set.add(ch)
+            # print(cur_set)
+            if ch == "u" and len(cur_set) == 5:
+                res = max(res, i - start + 1)
+            last_vowel = ch
+        return res