LeetCode OJ - Gas Station
来源:互联网 发布:加拿大28百分百中算法 编辑:程序博客网 时间:2024/05/20 08:23
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.
分析:DP学艺不精,用了发现不对,因为找的子问题没有重复子问题,故仅仅是递归。
采用两层循环,时间复杂度为O(n*n),估计不满足要求。
class Solution {public: int canCompleteCircuit(vector<int> &gas, vector<int> &cost) { // Note: The Solution object is instantiated only once and is reused by each test case. int sum=0; int total=0; int start=0; for(int i=0;i<gas.size();i++) { sum+=gas[i]-cost[i]; total+=gas[i]-cost[i]; if(sum < 0) { start=(i+1)%gas.size(); sum=0; } } if(total <0) return -1; else return start; }};
0 0
- LeetCode OJ:Gas Station
- LeetCode OJ - Gas Station
- LeetCode OJ : Gas Station
- LeetCode OJ——Gas Station
- LeetCode OJ 之 Gas Station (加油站)
- LeetCode:Gas Station
- [LeetCode] Gas Station
- [leetcode]Gas Station
- Leetcode: Gas Station
- LeetCode:Gas Station
- [LeetCode] Gas Station
- leetcode Gas Station
- [LeetCode]Gas Station
- LeetCode 之 Gas Station
- leetcode Gas Station
- 【Leetcode】Gas Station
- LeetCode | Gas Station
- LeetCode之Gas Station
- [LeetCode] Swap Nodes in Pairs
- 作用域
- iOS获取某一时间点视频桢截图
- virtualbox 中主机的上网设置
- J2EE——2014.5.24
- LeetCode OJ - Gas Station
- strong and weak 强引用和弱引用的区别
- C/C++ 内存分配方式,堆区,栈区,new/delete/malloc/free
- 二叉树的链式存储与实现(C++)
- 全国大中学生体测取消选测 长跑成为必测项目
- 怎样让吐司机器中三个任务相互协作
- lua 之newlabel
- poj 3258-River Hopscotch
- Python集合(set)类型的操作