LeetCode Gas Station
来源:互联网 发布:单片机呼吸灯原理图 编辑:程序博客网 时间:2024/05/16 17:56
LeetCode Gas Station
Gas Station
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.
//思路:动规or贪心?//1、设 vRemain[i]=gas[i]-cost[i],如果vRemain[i]>=0则第i站的汽可以满足走向下一站,vRemain[i]<0则此战的汽不能满足走向下一站//2、遍历vRemain[i],每个vRemain[i]>=0都有可能是一个起点。累加后面的数据,若出现累加和<0的情况则不能到达下一站,需要重新选择新的起点int canCompleteCircuit(vector<int> &gas, vector<int> &cost) {vector<int> vRemain;int n = gas.size();for(int i=0; i<n; i++)vRemain.push_back(gas[i] - cost[i]);for(int i=0; i<n; i++){if(vRemain[i] >= 0){//可能是一个可以开始的点int sum = 0;for(int j=i; j<n; j++){sum += vRemain[j];if(sum < 0)break;}if(sum >= 0){for(int k=0; k<i; k++){sum += vRemain[k];if(sum < 0)break;}}if(sum >= 0)return i;}}return -1;}
0 0
- 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: Gas Station
- LeetCode OJ:Gas Station
- [LeetCode]134.Gas Station
- [Leetcode] Gas Station (Java)
- gas station leetcode
- 人品计算器作业
- 求此效果该如何实现
- Leetcode_26_Remove Duplicates from Sorted Array
- C语快速入门教程(3)
- 关于在Eclipse中部署时webapps目录下没有web应用程序的解决办法
- LeetCode Gas Station
- EJB(四)JPA 分布式事务处理
- awk:语法命令学习
- 关于时间管理的一些沉淀
- android 获取联系人
- Android 关于Bitmap对象于内存管理
- poj 2007 Scrambled Polygon 凸包点排序逆时针输出
- 僵尸进程和孤儿进程的区别
- 原来Github上的README.md文件这么有意思——Markdown语言详解