Gas Station问题及解法
来源:互联网 发布:下载语文辅导软件 编辑:程序博客网 时间:2024/09/21 09:22
问题描述:
There are N gas stations along a circular route, where the amount of gas at station i is gas[i]
.
You have a car with an unlimited gas tank and it costs cost[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.
问题分析:
1.首先应该明确一点:若gas的总量>= cost的总量,那么一定存在一条解决路径。
2.寻找起点:设置起点res = 0;依次迭代到i,若res到i项cost和gas的和小于0,则证明res并不是真正的起点,重设res = i + 1,重复迭代过程。
过程详见代码:
class Solution {public: int canCompleteCircuit(vector<int>& gas, vector<int>& cost) { int size = gas.size();int sum = 0;int res = 0;int total = 0;for (int i = 0; i<size; ++i){sum += gas[i] - cost[i];if (sum<0){total += sum;sum = 0;res = i + 1;}}total += sum;return total<0 ? -1 : res % size; }};
阅读全文
0 0
- Gas Station问题及解法
- Gas Station [leetcode] 的两种解法
- Gas Station 加油站问题 @LeetCode
- Gas Station 汽油站问题
- 【LeetCode】加油站问题 gas station
- Gas Station 加油站问题【oj】
- LeetCode-Gas Station(加油站问题)
- Gas Station 汽车加油问题
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- Gas Station
- Codeforces Round #228 (Div. 1) B. Fox and Minimal path
- CSS选择符间空格与不空格的区别。
- 搭建一个基础的Spring Cloud项目
- 同步复制技术实现步骤
- PB中实现文件的拷贝与删除
- Gas Station问题及解法
- javascript 常用获取时间的方法
- 最新海康摄像机、NVR、流媒体服务器、回放取流RTSP地址规则说明
- springmvc http content-type
- codeforces.com/contest/839/
- 微服务开发的入门级框架Spring Boot详解(二)
- 4.3广义表
- Xilinx reVISION开搞!【reVISION】
- oom原理分析