Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 81560c5

Browse files
feat: add solutions to lc problem: No.1184 (doocs#3529)
1 parent c08d806 commit 81560c5

File tree

9 files changed

+131
-76
lines changed

9 files changed

+131
-76
lines changed

‎solution/1100-1199/1184.Distance Between Bus Stops/README.md‎

Lines changed: 45 additions & 25 deletions
Original file line numberDiff line numberDiff line change
@@ -75,9 +75,9 @@ tags:
7575

7676
### 方法一:模拟
7777

78-
我们可以先统计出公交车的总行驶距离 $s,ドル然后模拟公交车的行驶过程,从出发点开始,每次向右移动一站,直到到达目的地为止。在模拟的过程中,我们可以记录从出发点到目的地的距离 $a,ドル那么从目的地到出发点的最短距离就是 $\min(a, s - a)$。
78+
我们可以先统计出公交车的总行驶距离 $s,ドル然后模拟公交车的行驶过程,从出发点开始,每次向右移动一站,直到到达目的地为止,记录下这个过程中的行驶距离 $t,ドル最后返回 $t$ 和 $s - t$ 中的最小值即可。
7979

80-
时间复杂度 $O(n),ドル其中 $n$ 是公交车站的数量。空间复杂度 $O(1)$。
80+
时间复杂度 $O(n),ドル其中 $n$ 是数组 $\textit{distance}$ 的长度。空间复杂度 $O(1)$。
8181

8282
<!-- tabs:start -->
8383

@@ -88,11 +88,12 @@ class Solution:
8888
def distanceBetweenBusStops(
8989
self, distance: List[int], start: int, destination: int
9090
) -> int:
91-
a, n = 0, len(distance)
91+
s = sum(distance)
92+
t, n = 0, len(distance)
9293
while start != destination:
93-
a += distance[start]
94+
t += distance[start]
9495
start = (start + 1) % n
95-
return min(a, sum(distance) - a)
96+
return min(t, s - t)
9697
```
9798

9899
#### Java
@@ -101,13 +102,12 @@ class Solution:
101102
class Solution {
102103
public int distanceBetweenBusStops(int[] distance, int start, int destination) {
103104
int s = Arrays.stream(distance).sum();
104-
int n = distance.length;
105-
int a = 0;
105+
int n = distance.length, t = 0;
106106
while (start != destination) {
107-
a += distance[start];
107+
t += distance[start];
108108
start = (start + 1) % n;
109109
}
110-
return Math.min(a, s - a);
110+
return Math.min(t, s - t);
111111
}
112112
}
113113
```
@@ -119,12 +119,12 @@ class Solution {
119119
public:
120120
int distanceBetweenBusStops(vector<int>& distance, int start, int destination) {
121121
int s = accumulate(distance.begin(), distance.end(), 0);
122-
int a = 0, n = distance.size();
122+
int t = 0, n = distance.size();
123123
while (start != destination) {
124-
a += distance[start];
124+
t += distance[start];
125125
start = (start + 1) % n;
126126
}
127-
return min(a, s - a);
127+
return min(t, s - t);
128128
}
129129
};
130130
```
@@ -133,16 +133,15 @@ public:
133133
134134
```go
135135
func distanceBetweenBusStops(distance []int, start int, destination int) int {
136-
s := 0
136+
s, t := 0, 0
137137
for _, x := range distance {
138138
s += x
139139
}
140-
a, n := 0, len(distance)
141140
for start != destination {
142-
a += distance[start]
143-
start = (start + 1) % n
141+
t += distance[start]
142+
start = (start + 1) % len(distance)
144143
}
145-
return min(a, s-a)
144+
return min(t, s-t)
146145
}
147146
```
148147

@@ -151,13 +150,34 @@ func distanceBetweenBusStops(distance []int, start int, destination int) int {
151150
```ts
152151
function distanceBetweenBusStops(distance: number[], start: number, destination: number): number {
153152
const s = distance.reduce((a, b) => a + b, 0);
154-
let a = 0;
155153
const n = distance.length;
156-
while (start != destination) {
157-
a += distance[start];
154+
let t = 0;
155+
while (start !== destination) {
156+
t += distance[start];
158157
start = (start + 1) % n;
159158
}
160-
return Math.min(a, s - a);
159+
return Math.min(t, s - t);
160+
}
161+
```
162+
163+
#### Rust
164+
165+
```rust
166+
impl Solution {
167+
pub fn distance_between_bus_stops(distance: Vec<i32>, start: i32, destination: i32) -> i32 {
168+
let s: i32 = distance.iter().sum();
169+
let mut t = 0;
170+
let n = distance.len();
171+
let mut start = start as usize;
172+
let destination = destination as usize;
173+
174+
while start != destination {
175+
t += distance[start];
176+
start = (start + 1) % n;
177+
}
178+
179+
t.min(s - t)
180+
}
161181
}
162182
```
163183

@@ -172,13 +192,13 @@ function distanceBetweenBusStops(distance: number[], start: number, destination:
172192
*/
173193
var distanceBetweenBusStops = function (distance, start, destination) {
174194
const s = distance.reduce((a, b) => a + b, 0);
175-
let a = 0;
176195
const n = distance.length;
177-
while (start != destination) {
178-
a += distance[start];
196+
let t = 0;
197+
while (start !== destination) {
198+
t += distance[start];
179199
start = (start + 1) % n;
180200
}
181-
return Math.min(a, s - a);
201+
return Math.min(t, s - t);
182202
};
183203
```
184204

‎solution/1100-1199/1184.Distance Between Bus Stops/README_EN.md‎

Lines changed: 45 additions & 25 deletions
Original file line numberDiff line numberDiff line change
@@ -94,9 +94,9 @@ tags:
9494

9595
### Solution 1: Simulation
9696

97-
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)$.
97+
We can first calculate the total distance $s$ that the bus travels, then simulate the bus's journey. Starting from the departure point, we move one stop to the right each time until we reach the destination, recording the travel distance $t$ during this process. Finally, we return the minimum value between $t$ and $s - t$.
9898

99-
The time complexity is $O(n),ドル where $n$ is the number of bus stops. The space complexity is $O(1)$.
99+
The time complexity is $O(n),ドル where $n$ is the length of the array $\textit{distance}$. The space complexity is $O(1)$.
100100

101101
<!-- tabs:start -->
102102

@@ -107,11 +107,12 @@ class Solution:
107107
def distanceBetweenBusStops(
108108
self, distance: List[int], start: int, destination: int
109109
) -> int:
110-
a, n = 0, len(distance)
110+
s = sum(distance)
111+
t, n = 0, len(distance)
111112
while start != destination:
112-
a += distance[start]
113+
t += distance[start]
113114
start = (start + 1) % n
114-
return min(a, sum(distance) - a)
115+
return min(t, s - t)
115116
```
116117

117118
#### Java
@@ -120,13 +121,12 @@ class Solution:
120121
class Solution {
121122
public int distanceBetweenBusStops(int[] distance, int start, int destination) {
122123
int s = Arrays.stream(distance).sum();
123-
int n = distance.length;
124-
int a = 0;
124+
int n = distance.length, t = 0;
125125
while (start != destination) {
126-
a += distance[start];
126+
t += distance[start];
127127
start = (start + 1) % n;
128128
}
129-
return Math.min(a, s - a);
129+
return Math.min(t, s - t);
130130
}
131131
}
132132
```
@@ -138,12 +138,12 @@ class Solution {
138138
public:
139139
int distanceBetweenBusStops(vector<int>& distance, int start, int destination) {
140140
int s = accumulate(distance.begin(), distance.end(), 0);
141-
int a = 0, n = distance.size();
141+
int t = 0, n = distance.size();
142142
while (start != destination) {
143-
a += distance[start];
143+
t += distance[start];
144144
start = (start + 1) % n;
145145
}
146-
return min(a, s - a);
146+
return min(t, s - t);
147147
}
148148
};
149149
```
@@ -152,16 +152,15 @@ public:
152152
153153
```go
154154
func distanceBetweenBusStops(distance []int, start int, destination int) int {
155-
s := 0
155+
s, t := 0, 0
156156
for _, x := range distance {
157157
s += x
158158
}
159-
a, n := 0, len(distance)
160159
for start != destination {
161-
a += distance[start]
162-
start = (start + 1) % n
160+
t += distance[start]
161+
start = (start + 1) % len(distance)
163162
}
164-
return min(a, s-a)
163+
return min(t, s-t)
165164
}
166165
```
167166

@@ -170,13 +169,34 @@ func distanceBetweenBusStops(distance []int, start int, destination int) int {
170169
```ts
171170
function distanceBetweenBusStops(distance: number[], start: number, destination: number): number {
172171
const s = distance.reduce((a, b) => a + b, 0);
173-
let a = 0;
174172
const n = distance.length;
175-
while (start != destination) {
176-
a += distance[start];
173+
let t = 0;
174+
while (start !== destination) {
175+
t += distance[start];
177176
start = (start + 1) % n;
178177
}
179-
return Math.min(a, s - a);
178+
return Math.min(t, s - t);
179+
}
180+
```
181+
182+
#### Rust
183+
184+
```rust
185+
impl Solution {
186+
pub fn distance_between_bus_stops(distance: Vec<i32>, start: i32, destination: i32) -> i32 {
187+
let s: i32 = distance.iter().sum();
188+
let mut t = 0;
189+
let n = distance.len();
190+
let mut start = start as usize;
191+
let destination = destination as usize;
192+
193+
while start != destination {
194+
t += distance[start];
195+
start = (start + 1) % n;
196+
}
197+
198+
t.min(s - t)
199+
}
180200
}
181201
```
182202

@@ -191,13 +211,13 @@ function distanceBetweenBusStops(distance: number[], start: number, destination:
191211
*/
192212
var distanceBetweenBusStops = function (distance, start, destination) {
193213
const s = distance.reduce((a, b) => a + b, 0);
194-
let a = 0;
195214
const n = distance.length;
196-
while (start != destination) {
197-
a += distance[start];
215+
let t = 0;
216+
while (start !== destination) {
217+
t += distance[start];
198218
start = (start + 1) % n;
199219
}
200-
return Math.min(a, s - a);
220+
return Math.min(t, s - t);
201221
};
202222
```
203223

‎solution/1100-1199/1184.Distance Between Bus Stops/Solution.cpp‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -2,11 +2,11 @@ class Solution {
22
public:
33
int distanceBetweenBusStops(vector<int>& distance, int start, int destination) {
44
int s = accumulate(distance.begin(), distance.end(), 0);
5-
int a = 0, n = distance.size();
5+
int t = 0, n = distance.size();
66
while (start != destination) {
7-
a += distance[start];
7+
t += distance[start];
88
start = (start + 1) % n;
99
}
10-
return min(a, s - a);
10+
return min(t, s - t);
1111
}
12-
};
12+
};
Lines changed: 5 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -1,12 +1,11 @@
11
func distanceBetweenBusStops(distance []int, start int, destination int) int {
2-
s:= 0
2+
s, t:=0, 0
33
for _, x := range distance {
44
s += x
55
}
6-
a, n := 0, len(distance)
76
for start != destination {
8-
a += distance[start]
9-
start = (start + 1) % n
7+
t += distance[start]
8+
start = (start + 1) % len(distance)
109
}
11-
return min(a, s-a)
12-
}
10+
return min(t, s-t)
11+
}
Lines changed: 4 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,12 +1,11 @@
11
class Solution {
22
public int distanceBetweenBusStops(int[] distance, int start, int destination) {
33
int s = Arrays.stream(distance).sum();
4-
int n = distance.length;
5-
int a = 0;
4+
int n = distance.length, t = 0;
65
while (start != destination) {
7-
a += distance[start];
6+
t += distance[start];
87
start = (start + 1) % n;
98
}
10-
return Math.min(a, s - a);
9+
return Math.min(t, s - t);
1110
}
12-
}
11+
}

‎solution/1100-1199/1184.Distance Between Bus Stops/Solution.js‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -6,11 +6,11 @@
66
*/
77
var distanceBetweenBusStops = function (distance, start, destination) {
88
const s = distance.reduce((a, b) => a + b, 0);
9-
let a = 0;
109
const n = distance.length;
11-
while (start != destination) {
12-
a += distance[start];
10+
let t = 0;
11+
while (start !== destination) {
12+
t += distance[start];
1313
start = (start + 1) % n;
1414
}
15-
return Math.min(a, s - a);
15+
return Math.min(t, s - t);
1616
};

‎solution/1100-1199/1184.Distance Between Bus Stops/Solution.py‎

Lines changed: 4 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -2,8 +2,9 @@ class Solution:
22
def distanceBetweenBusStops(
33
self, distance: List[int], start: int, destination: int
44
) -> int:
5-
a, n = 0, len(distance)
5+
s = sum(distance)
6+
t, n = 0, len(distance)
67
while start != destination:
7-
a += distance[start]
8+
t += distance[start]
89
start = (start + 1) % n
9-
return min(a, sum(distance) - a)
10+
return min(t, s - t)
Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
impl Solution {
2+
pub fn distance_between_bus_stops(distance: Vec<i32>, start: i32, destination: i32) -> i32 {
3+
let s: i32 = distance.iter().sum();
4+
let mut t = 0;
5+
let n = distance.len();
6+
let mut start = start as usize;
7+
let destination = destination as usize;
8+
9+
while start != destination {
10+
t += distance[start];
11+
start = (start + 1) % n;
12+
}
13+
14+
t.min(s - t)
15+
}
16+
}
Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,10 +1,10 @@
11
function distanceBetweenBusStops(distance: number[], start: number, destination: number): number {
22
const s = distance.reduce((a, b) => a + b, 0);
3-
let a = 0;
43
const n = distance.length;
5-
while (start != destination) {
6-
a += distance[start];
4+
let t = 0;
5+
while (start !== destination) {
6+
t += distance[start];
77
start = (start + 1) % n;
88
}
9-
return Math.min(a, s - a);
9+
return Math.min(t, s - t);
1010
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /