2020-02-12

Author: JiayangWu

1346.检查整数及其两倍数是否存在/1346-检查整数及其两倍数是否存在.py

@@ -0,0 +1,18 @@
+class Solution(object):
+    def checkIfExist(self, arr):
+        """
+        :type arr: List[int]
+        :rtype: bool
+        """
+        if arr.count(0) > 1:
+            return True
+        
+        arr = set(arr) - set([0])
+
+        for x in arr:
+            if x * 2 in arr:
+                return True
+            
+        return False
+        
+        

1347.制造字母异位词的最小步骤数/1347-制造字母异位词的最小步骤数.py

@@ -0,0 +1,17 @@
+class Solution(object):
+    def minSteps(self, s, t):
+        """
+        :type s: str
+        :type t: str
+        :rtype: int
+        """
+        n = len(t)
+        from collections import Counter
+        dic1 = Counter(s)
+        dic2 = Counter(t)
+        
+        valid = 0
+        for char, fre in dic2.items():
+            valid += min(dic1[char], fre)
+            
+        return n - valid