2019-11-13

Author: Jiayang Wu

.DS_Store

@@ -0,0 +1,23 @@
+class Solution(object):
+    def findRightInterval(self, intervals):
+        """
+        :type intervals: List[List[int]]
+        :rtype: List[int]
+        """
+        dic = {}
+        for i, (start, end) in enumerate(intervals):
+            dic[start] = i
+
+        res = [-1 for _ in range(len(intervals))]
+
+        l = [interval[0] for interval in intervals]
+        l = sorted(l, key = lambda x:x)
+
+        for i, (start, end) in enumerate(intervals):
+            idx = bisect.bisect_left(l, end)
+            if idx < len(l):
+                res[i] = dic[l[idx]]
+                
+        return res
+            
+            

0436.寻找右区间/0436-寻找右区间.py

@@ -0,0 +1,18 @@
+class Solution(object):
+    def licenseKeyFormatting(self, S, K):
+        """
+        :type S: str
+        :type K: int
+        :rtype: str
+        """
+        s = "".join(S.split("-")).upper()
+        length_of_first_part = len(s) % K
+        if not length_of_first_part:
+            length_of_first_part = K
+            
+        res = s[:length_of_first_part]
+        for i in range(length_of_first_part, len(s), K):
+            res += "-"
+            res += s[i:i+K]
+        return res
+        

0482.密钥格式化/0482-密钥格式化.py

@@ -0,0 +1,37 @@
+class Solution(object):
+    def shortestWay(self, source, target):
+        """
+        :type source: str
+        :type target: str
+        :rtype: int
+        """
+
+        import collections
+        dicse = collections.Counter(source)
+        dictt = collections.Counter(target)
+
+        for key, val in dictt.items():
+            if dicse.get(key, 0) == 0:
+                return -1
+
+        cnt = 0
+        start, end = 0, 0
+        i = 0
+        while(i < len(target)):
+            char = target[i]
+            while(source[start] != char): #找起点，一定能找到
+                start += 1
+            end = start + 1
+
+            i += 1
+            while(i < len(target) and end < len(source)):
+                if source[end] == target[i]: #找最长的子序列
+                    i += 1
+                end += 1
+
+            cnt += 1
+            start = 0 #重置起点，为下一轮做准备
+            
+        return cnt
+
+