2020-01-26

JiayangWu · JiayangWu · commit 311f339e31ca · 2020-01-26T21:40:27.000-05:00
diff --git a/1333.餐厅过滤器/1333-餐厅过滤器.py b/1333.餐厅过滤器/1333-餐厅过滤器.py
@@ -0,0 +1,19 @@
+class Solution(object):
+    def filterRestaurants(self, restaurants, veganFriendly, maxPrice, maxDistance):
+        """
+        :type restaurants: List[List[int]]
+        :type veganFriendly: int
+        :type maxPrice: int
+        :type maxDistance: int
+        :rtype: List[int]
+        """
+        if not restaurants:
+            return []
+        
+        res = []
+        for i, rating, vF, mP, mD in restaurants:
+            if not veganFriendly or (vF and veganFriendly):
+                if mP <= maxPrice and mD <= maxDistance:
+                    res.append([i, rating])
+
+        return [i for i, rating in sorted(res, key = lambda x:(x[1], x[0]), reverse = True)]
diff --git a/1334.阈值距离内邻居最少的城市/1334-阈值距离内邻居最少的城市.py b/1334.阈值距离内邻居最少的城市/1334-阈值距离内邻居最少的城市.py
@@ -0,0 +1,33 @@
+class Solution(object):
+    def findTheCity(self, n, edges, distanceThreshold):
+        """
+        :type n: int
+        :type edges: List[List[int]]
+        :type distanceThreshold: int
+        :rtype: int
+        """
+        distance = [[float("inf") for j in range(n)] for i in range(n)]
+            
+        for start, end, w in edges:
+            distance[start][end] = w
+            distance[end][start] = w
+        for i in range(n):
+            distance[i][i] = 0
+        for i in range(n):
+            for j in range(n):
+                for k in range(n):
+                     distance[j][k] = min(distance[j][k], distance[j][i] + distance[i][k])
+
+        min_cnt = 101
+        res = None
+        for i in range(n):
+            cnt = 0
+            for j in range(n):
+                if distance[i][j] <= distanceThreshold:
+                    cnt += 1
+
+            if cnt <= min_cnt:
+                res = i
+                min_cnt = cnt
+        return res
+        
