ARST打卡第168周[168/521]

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48

/*
直接遍历就完事了
*/
func distanceBetweenBusStops(distance []int, start int, destination int) int {
	ans := 0
	if start == destination {
		return ans
	}
	if start > destination {
		start, destination = destination, start
	}
	tmp := 0
	n := len(distance)
	for i := start; i < destination; i++ {
		tmp += distance[i]
	}
	ans, tmp = tmp, 0
	for i := destination; i < start+n; i++ {
		tmp += distance[i%n]
	}
	if tmp < ans {
		ans = tmp
	}
	return ans
}

// 答案写得比我更简洁，学习之
func distanceBetweenBusStops_ans(distance []int, start, destination int) int {
	if start > destination {
		start, destination = destination, start
	}
	sum1, sum2 := 0, 0
	for i, d := range distance {
		if start <= i && i < destination {
			sum1 += d
		} else {
			sum2 += d
		}
	}
	return min(sum1, sum2)
}

func min(a, b int) int {
	if a > b {
		return b
	}
	return a
}