题目:原题链接(中等)
标签:贪心算法、排序
解法 | 时间复杂度 | 空间复杂度 | 执行用时 |
---|---|---|---|
Ans 1 (Python) | O ( N 2 l o g N 2 ) O(N^2logN^2) O(N2logN2) | O ( N 2 ) O(N^2) O(N2) | 2120ms (6.06%) |
Ans 2 (Python) | |||
Ans 3 (Python) |
解法一:
class Solution:
def assignBikes(self, workers: List[List[int]], bikes: List[List[int]]) -> List[int]:
s1, s2 = len(workers), len(bikes)
distances = []
for i in range(s1):
for j in range(s2):
distance = abs(workers[i][0] - bikes[j][0]) + abs(workers[i][1] - bikes[j][1])
distances.append([distance, i, j])
waiting = s1 # 等待人数
bikes_stat = [True] * s2 # 自行车被占用的状态
ans = [-1] * s1
for distance, i, j in sorted(distances):
if ans[i] == -1 and bikes_stat[j] is True:
ans[i] = j
waiting -= 1
bikes_stat[j] = False
if waiting == 0:
break
return ans