题目要求:
https://leetcode-cn.com/problems/distance-between-bus-stops/submissions/
思路:
注意start有可能大于destination的情况。
class Solution:
def distanceBetweenBusStops(self, distance: List[int], start: int, destination: int) -> int:
a = 0
if start > destination:
start, destination = destination, start
for i in range(start, destination):
a = a + distance[i]
total = sum(distance)
b = total - a
return min(a, b)