2019-07-17

Author: JiayangWu

0599.两个列表的最小索引总和/0599-两个列表的最小索引总和.py

@@ -0,0 +1,24 @@
+class Solution(object):
+    def findRestaurant(self, list1, list2):
+        """
+        :type list1: List[str]
+        :type list2: List[str]
+        :rtype: List[str]
+        """
+        dict = {}
+        for i, item in enumerate(list1):
+            dict[item] = i
+            
+        minIdxSum = 2 ** 32
+        res = []
+        for i, item in enumerate(list2):
+            if item in dict: #当前餐厅两者都爱
+                tmp = i + dict[item]
+                if tmp < minIdxSum: #需要更新最小索引和
+                    res = [item]
+                    minIdxSum = tmp
+                elif tmp == minIdxSum: #是目前的最小索引和
+                    res.append(item)
+        return res
+            
+        

0648.单词替换/0648-单词替换.py

@@ -0,0 +1,17 @@
+class Solution(object):
+    def replaceWords(self, dict, sentence):
+        """
+        :type dict: List[str]
+        :type sentence: str
+        :rtype: str
+        """
+        dict = set(dict)
+        
+        s = sentence.split(" ")
+        
+        for i, word in enumerate(s):
+            for j in range(len(word)):
+                if word[:j + 1] in dict:
+                    s[i] = word[:j + 1]
+                    break
+        return " ".join(s)

0817.链表组件/0817-链表组件.py

@@ -0,0 +1,36 @@
+# Definition for singly-linked list.
+# class ListNode(object):
+#     def __init__(self, x):
+#         self.val = x
+#         self.next = None
+
+class Solution(object):
+    def numComponents(self, head, G):
+        """
+        :type head: ListNode
+        :type G: List[int]
+        :rtype: int
+        """
+        g = []
+        G = set(G)
+        p = head
+        while p: #处理相对排序
+            if p.val in G:
+                g.append(p.val)
+            p = p.next
+            
+        p, i, res = head, 0, 0
+        seperate = True #用于标记当前是不是断开
+        while i < len(g) and p:
+            if g[i] == p.val:
+                if seperate == True: #当前是断开状态
+                    res += 1 #所以给res + 1
+                    seperate = False #表示当前是连续
+                p = p.next
+                i += 1
+            else:
+                seperate = True #已经断开
+                p = p.next
+        return res
+        
+   

1119.删去字符串中的元音/1119-删去字符串中的元音.py

@@ -4,9 +4,4 @@ def removeVowels(self, S):
         :type S: str
         :rtype: str
         """
-        res = ""
-        for char in S:
-            if char not in "aeiou":
-                res += char
-                
-        return res
+        return "".join(char for char in S if char not in "aeiou")

1121.将数组分成几个递增序列/1121-将数组分成几个递增序列.py

@@ -5,12 +5,5 @@ def canDivideIntoSubsequences(self, nums, K):
         :type K: int
         :rtype: bool
         """
-        if len(nums) < K:
-            return False
         from collections import Counter
-        d = Counter(nums)
-        maxx = 1
-        for key, val in d.items():
-            maxx = max(val, maxx)
-            
-        return maxx * K <= len(nums)
+        return max(Counter(nums).values()) * K <= len(nums)