同步操作将从 doocs/leetcode 强制同步,此操作会覆盖自 Fork 仓库以来所做的任何修改,且无法恢复!!!
确定后同步将在后台操作,完成时将刷新页面,请耐心等待。
A bus has n
stops numbered from 0
to n - 1
that form a circle. We know the distance between all pairs of neighboring stops where distance[i]
is the distance between the stops number i
and (i + 1) % n
.
The bus goes along both directions i.e. clockwise and counterclockwise.
Return the shortest distance between the given start
and destination
stops.
Example 1:
Input: distance = [1,2,3,4], start = 0, destination = 1 Output: 1 Explanation: Distance between 0 and 1 is 1 or 9, minimum is 1.
Example 2:
Input: distance = [1,2,3,4], start = 0, destination = 2 Output: 3 Explanation: Distance between 0 and 2 is 3 or 7, minimum is 3.
Example 3:
Input: distance = [1,2,3,4], start = 0, destination = 3 Output: 4 Explanation: Distance between 0 and 3 is 6 or 4, minimum is 4.
Constraints:
1 <= n <= 10^4
distance.length == n
0 <= start, destination < n
0 <= distance[i] <= 10^4
First, we can calculate the total distance $s$ that the bus travels. Then, we simulate the bus's journey, starting from the departure point, moving one stop to the right each time, until we reach the destination. During the simulation, we can record the distance $a$ from the departure point to the destination. Therefore, the shortest distance from the destination to the departure point is $\min(a, s - a)$.
The time complexity is $O(n)$, where $n$ is the number of bus stops. The space complexity is $O(1)$.
class Solution:
def distanceBetweenBusStops(
self, distance: List[int], start: int, destination: int
) -> int:
a, n = 0, len(distance)
while start != destination:
a += distance[start]
start = (start + 1) % n
return min(a, sum(distance) - a)
class Solution {
public int distanceBetweenBusStops(int[] distance, int start, int destination) {
int s = Arrays.stream(distance).sum();
int n = distance.length;
int a = 0;
while (start != destination) {
a += distance[start];
start = (start + 1) % n;
}
return Math.min(a, s - a);
}
}
class Solution {
public:
int distanceBetweenBusStops(vector<int>& distance, int start, int destination) {
int s = accumulate(distance.begin(), distance.end(), 0);
int a = 0, n = distance.size();
while (start != destination) {
a += distance[start];
start = (start + 1) % n;
}
return min(a, s - a);
}
};
func distanceBetweenBusStops(distance []int, start int, destination int) int {
s := 0
for _, x := range distance {
s += x
}
a, n := 0, len(distance)
for start != destination {
a += distance[start]
start = (start + 1) % n
}
return min(a, s-a)
}
function distanceBetweenBusStops(distance: number[], start: number, destination: number): number {
const s = distance.reduce((a, b) => a + b, 0);
let a = 0;
const n = distance.length;
while (start != destination) {
a += distance[start];
start = (start + 1) % n;
}
return Math.min(a, s - a);
}
/**
* @param {number[]} distance
* @param {number} start
* @param {number} destination
* @return {number}
*/
var distanceBetweenBusStops = function (distance, start, destination) {
const s = distance.reduce((a, b) => a + b, 0);
let a = 0;
const n = distance.length;
while (start != destination) {
a += distance[start];
start = (start + 1) % n;
}
return Math.min(a, s - a);
};
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。