gas-station
题目描述:
There are N gas stations along a circular route, where the amount of gas at station i isgas[i].
You have a car with an unlimited gas tank and it costscost[i]of gas to travel from station i to its next station (i+1). You begin the journey with an empty tank at one of the gas stations.
Return the starting gas station’s index if you can travel around the circuit once, otherwise return -1.
Note:
The solution is guaranteed to be unique.
知识点:
贪心算法
解题思路:
【个人思路】
首先要理解题意,在一条环形路上有N个加气站,站点i的气的体积为gas[i],你有一辆车气罐体积不受限,当从站点i到下一个站点i+1消耗气的体积为cost[i]。找到一个可以作为起点的站点,使得从该站点出发可以遍历完整个环形的道路,否则返回-1。
我们需要明确以下两个问题:
1.若gas的总量>=cost的总量,那么一定存在一条解决路径。
2.寻找起点:设置起点res=0;依次迭代到i,若resgas+=gas[i]-cost[