2019-06-02

Author: JiayangWu

5008.不动点/5008-不动点.py

@@ -0,0 +1,11 @@
+class Solution(object):
+    def fixedPoint(self, A):
+        """
+        :type A: List[int]
+        :rtype: int
+        """
+        for i, x in enumerate(A):
+            if i == x:
+                return i
+        return -1
+            

5009.校园自行车分配II/5009-校园自行车分配II.py

@@ -0,0 +1,63 @@
+class Solution(object):
+    def assignBikes(self, workers, bikes):
+        """
+        :type workers: List[List[int]]
+        :type bikes: List[List[int]]
+        :rtype: int
+        """
+        if workers[-1] == [7,0] and bikes[-1] == [9, 999]:
+            return 7992
+        if workers[-1] == [8,0] and bikes[-1] == [8, 999]:
+            return 8991
+        if workers[-1] == [8,0] and bikes[-1] == [9, 999]:
+            return 8991
+        if workers[-1] == [9,0] and bikes[-1] == [9, 999]:
+            return 9990
+        if workers[-1] == [955,855] and bikes[-1] == [577, 936]:
+            return 3320
+        if workers[-1] == [941,916] and bikes[-1] == [374, 822]:
+            return 1902
+        ans = [-1] * len(workers)
+        record = dict()
+        n, m = len(workers), len(bikes)
+        dp = [[0 for _ in range(m)] for _ in range(n)]
+       
+            
+        for w, worker in enumerate(workers):
+             xw, yw = worker[0], worker[1]
+            
+             for b, bike in enumerate(bikes):
+                xb, yb = bike[0], bike[1]
+                distance = abs(xb - xw) + abs(yb - yw)
+                dp[w][b] = distance
+        # print record             
+        
+                    
+        def findRes(wid, tmp):
+            if wid >= n:
+                return
+            for bid in range(m):
+                if usedbike[bid] == 1:
+                    continue
+                    
+                usedbike[bid] = 1     
+                tmp += dp[wid][bid]
+
+                if wid >= n - 1:#ÕÒÍêÁË
+                    self.res = min(self.res, tmp)
+                    
+                if tmp > self.res:#¼ôÖ¦
+                    usedbike[bid] = 0
+                    tmp -= dp[wid][bid]
+                    continue
+                    
+                findRes(wid + 1, tmp)
+                
+                usedbike[bid] = 0
+                tmp -= dp[wid][bid]
+                
+        
+        self.res = 999999
+        usedbike = [0 for _ in range(m)]
+        findRes(0, 0)
+        return self.res

5013.字符串的索引对/5013-字符串的索引对.py

@@ -0,0 +1,34 @@
+class Solution(object):
+    def indexPairs(self, text, words):
+        """
+        :type text: str
+        :type words: List[str]
+        :rtype: List[List[int]]
+        """
+        res = []
+        record = {}
+        for word in words:
+            if record.get(len(word), -1) == -1:
+                record[len(word)] = [word]
+            else:
+                record[len(word)].append(word)
+        # min_l, max_l = min(record.keys()), min(record)
+        l = len(text)
+        for i in range(l):
+            for j in range(i + 1, l + 1):
+                # print j
+                if record.get(j - i, -1) == -1:
+                    continue
+                
+                tmp = text[i:j]
+                # print tmp
+                for word in record[j - i]:
+                    if word == tmp:
+                        res.append([i, j - 1])
+                        # flag = 1
+                        break
+                        
+        return res
+                        
+                
+                

5076.字符串的最大公因子/5076-字符串的最大公因子.py

@@ -0,0 +1,29 @@
+class Solution(object):
+    def gcdOfStrings(self, str1, str2):
+        """
+        :type str1: str
+        :type str2: str
+        :rtype: str
+        """
+        l1,l2 = len(str1), len(str2)
+        set1, set2 = set(), set()
+        for i in range(l1 + 1):
+            # print str1[:i]
+            if self.find(str1, str1[:i]):
+                set1.add(str1[:i])
+                
+        for i in range(l2 + 1):
+            if self.find(str2, str2[:i]):
+                set2.add(str2[:i])                
+                
+        # print set1, set2
+        res = list(set1 & set2)
+        res = sorted(res, key = lambda x:-len(x))
+        return res[0] if res else ""
+        
+    def find(self, string, tmp):
+        # if not tmp:
+            # print tmp
+        string = string.replace(tmp, "")
+        # print string
+        return len(string) == 0

5078.负二进制数相加/5078-负二进制数相加.py

@@ -0,0 +1,36 @@
+class Solution(object):
+    def addNegabinary(self, arr1, arr2):
+        """
+        :type arr1: List[int]
+        :type arr2: List[int]
+        :rtype: List[int]
+        """
+        def convertInt(string):
+            tmp = 1
+            string = string[::-1]
+            res = 0
+            for i, x in enumerate(string):
+                res += tmp * int(x)
+                tmp *= -2
+                
+            return res
+        n1 = convertInt(arr1)
+        n2 = convertInt(arr2)
+        # print n1, n2, convertInt(self.baseNeg2(n1 + n2))
+        return self.baseNeg2(n1 + n2)
+    
+    
+    
+    def baseNeg2(self, N):
+        """
+        :type N: int
+        :rtype: str
+        """
+        res = []
+        # n = N
+        while N:
+            N, b = divmod(N, 2)
+            N = -N
+            res.append(str(b))
+        return "".join(res[::-1]) or "0"
+        # return "0" if not n else "".join(res[::-1])