• 设为首页
  • 点击收藏
  • 手机版
    手机扫一扫访问
    迪恩网络手机版
  • 关注官方公众号
    微信扫一扫关注
    公众号

[Swift]LeetCode1184.公交站间的距离|DistanceBetweenBusStops

原作者: [db:作者] 来自: [db:来源] 收藏 邀请

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号:山青咏芝(shanqingyongzhi)
➤博客园地址:山青咏芝(www.zengqiang.org
➤GitHub地址:https://github.com/strengthen/LeetCode
➤原文地址:
➤如果链接不是山青咏芝的博客园地址,则可能是爬取作者的文章。
➤原文已修改更新!强烈建议点击原文地址阅读!支持作者!支持原创!
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

热烈欢迎,请直接点击!!!

进入博主App Store主页,下载使用各个作品!!!

注:博主将坚持每月上线一个新app!!!

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

环形公交路线上有 n 个站,按次序从 0 到 n - 1 进行编号。我们已知每一对相邻公交站之间的距离,distance[i] 表示编号为 i 的车站和编号为 (i + 1) % n 的车站之间的距离。

环线上的公交车都可以按顺时针和逆时针的方向行驶。

返回乘客从出发点 start 到目的地 destination 之间的最短距离。

 

示例 1:

输入:distance = [1,2,3,4], start = 0, destination = 1
输出:1
解释:公交站 0 和 1 之间的距离是 1 或 9,最小值是 1。

 

示例 2:

输入:distance = [1,2,3,4], start = 0, destination = 2
输出:3
解释:公交站 0 和 2 之间的距离是 3 或 7,最小值是 3。

 

示例 3:

输入:distance = [1,2,3,4], start = 0, destination = 3
输出:4
解释:公交站 0 和 3 之间的距离是 6 或 4,最小值是 4。

 

提示:

  • 1 <= n <= 10^4
  • distance.length == n
  • 0 <= start, destination < n
  • 0 <= distance[i] <= 10^4

20ms
 1 class Solution {
 2     func distanceBetweenBusStops(_ distance: [Int], _ start: Int, _ destination: Int) -> Int {
 3         var path = [0, 0]
 4         
 5         let lo = min(start, destination)
 6         let hi = max(start, destination)
 7 
 8         
 9         for i in 0 ..< lo {
10             path[0] += distance[i]
11         }
12         for i in lo ..< hi {
13             path[1] += distance[i]
14         }
15         for i in hi ..< distance.count {
16             path[0] += distance[i]
17         }
18         
19         return path[0] < path[1] ? path[0] : path[1]
20     }
21 }

Runtime: 24 ms

Memory Usage: 21.3 MB
 1 class Solution {
 2     func distanceBetweenBusStops(_ distance: [Int], _ start: Int, _ destination: Int) -> Int {
 3         var S:Int = 0
 4         var T:Int = 0
 5         var sum:Int = 0
 6         for i in 0..<distance.count
 7         {
 8             if i == start {S=sum}
 9             if i == destination {T=sum}
10             sum += distance[i]
11         }
12         return min(abs(T-S),sum-abs(T-S))
13     }
14 }

24ms

 

 1 class Solution {
 2     func distanceBetweenBusStops(_ distance: [Int], _ start: Int, _ destination: Int) -> Int {
 3         var pathA = 0
 4         var pathB = 0
 5         
 6         let lo = start < destination ? start : destination
 7         let hi = start > destination ? start : destination
 8 
 9         for i in 0 ..< lo {
10             pathA += distance[i]
11         }
12         for i in lo ..< hi {
13             pathB += distance[i]
14         }
15         for i in hi ..< distance.count {
16             pathA += distance[i]
17         }
18         
19         return pathA < pathB ? pathA : pathB
20     }
21 }

28ms

 1 class Solution {
 2     func distanceBetweenBusStops(_ distance: [Int], _ start: Int, _ destination: Int) -> Int {
 3         var path = [0, 0]
 4         
 5         let lo = min(start, destination)
 6         let hi = max(start, destination)
 7 
 8         
 9         for i in 0 ..< lo {
10             path[0] += distance[i]
11         }
12         for i in lo ..< hi {
13             path[1] += distance[i]
14         }
15         for i in hi ..< distance.count {
16             path[0] += distance[i]
17         }
18         
19         return path[0] < path[1] ? path[0] : path[1]
20     }
21 }

32ms

 1 class Solution {
 2     func distanceBetweenBusStops(_ distance: [Int], _ start: Int, _ destination: Int) -> Int {
 3         let a = min(start, destination)
 4     let b = max(start, destination)
 5     let sumDistance = distance.reduce(0) { result, num in result+num }
 6     var sum = 0
 7     for i in a..<b {
 8         sum += distance[i]
 9     }
10     return min(sum, sumDistance-sum)
11     }
12 }

 


鲜花

握手

雷人

路过

鸡蛋
该文章已有0人参与评论

请发表评论

全部评论

专题导读
上一篇:
Swift 和 Vapor 构建区块链服务器发布时间:2022-07-14
下一篇:
AppleSwift编程语言入门教程发布时间:2022-07-14
热门推荐
热门话题
阅读排行榜

扫描微信二维码

查看手机版网站

随时了解更新最新资讯

139-2527-9053

在线客服(服务时间 9:00~18:00)

在线QQ客服
地址:深圳市南山区西丽大学城创智工业园
电邮:jeky_zhao#qq.com
移动电话:139-2527-9053

Powered by 互联科技 X3.4© 2001-2213 极客世界.|Sitemap