Gas Station 汽油站問題
public:
int canCompleteCircuit(vector<int> &gas, vector<int> &cost) {
int startindex=0;
int sum=0;
int total=0;
for(int i=0;i<gas.size();i++)
{
sum+=gas[i]-cost[i];
total+=gas[i]-cost[i];
if(sum<0)
{
startindex=i+1;
sum=0;
}
}
return total>=0?startindex:-1;
}
};
相關推薦
Gas Station 汽油站問題
class Solution { public: int canCompleteCircuit(vector<int> &gas, vector<int> &cost) { int startindex=0; int sum=0;
leetcode 刷題之路 68 Gas Station
rom 說明 之路 bsp margin tom otto mono lee There are N gas stations along a circular route, where the amount of gas at station i is gas[i]
134. Gas Station
下一個 tar travel emp pan col ons -c amount There are N gas stations along a circular route, where the amount of gas at station i is gas[i].
[leetcode]134. Gas Station加油站
CA ise 如何 ring exists log public 積累 www There are N gas stations along a circular route, where the amount of gas at station i is gas[
PAT 1072 Gas Station (30)
esp 狀態 solution sam 不知道 specific 解決方案 sep ans A gas station has to be built at such a location that the minimum distance between the stat
PAT-ADVANCED1072——Gas Station
我的PAT-ADVANCED程式碼倉:https://github.com/617076674/PAT-ADVANCED 原題連結:https://pintia.cn/problem-sets/994805342720868352/problems/994805396953219072
LeetCode:134. Gas Station(Week 7)
134. 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
LeetCode 134 Gas Station
LeetCode 134 Gas Station 水題,暴力一下就ok class Solution { public: int tag[100005]; int sum[100005]; int canCompleteCircuit(vector<int>&
[Swift]LeetCode134. 加油站 | Gas Station
uniq plan journey 汽車 other direct with nbsp require There are N gas stations along a circular route, where the amount of gas at station i
[Leetcode 134]汽車加油站 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 unl
leetcode 134. Gas Station
leetcode 134. 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 ca
PAT甲級 1072 Gas Station (30 分)Dijkstra
1072 Gas Station (30 分) A gas station has to be built at such a location that the minimum distance between the station and any of the res
python leetcode 134. Gas Station 135. Candy
考察是將題目轉化為程式碼的能力 134. Gas Station class Solution(object): def canCompleteCircuit(self, gas, cost): """ :type gas: List[int]
PAT1072 Gas Station (30 分)
解析 #include<iostream> #include<string> #include<vector> #include<algorithm> #include<unordered_map> using name
1072 Gas Station (30 分)(最短路徑)
#include<bits/stdc++.h> using namespace std; const int N=1e3+100; int n,m,k,Ds; int mp[N][N]; int dis[N]; int vis[N]; int inf=0x3f3f3f3
【LeetCode】#134加油站(Gas Station)
【LeetCode】#134加油站(Gas Station) 題目描述 在一條環路上有 N 個加油站,其中第 i 個加油站有汽油 gas[i] 升。 你有一輛油箱容量無限的的汽車,從第 i 個加油站開往第 i+1 個加油站需要消耗汽油 cost[i] 升。你從其中的一個加油站出發,開
PAT (Advanced Level) Practice 1072 Gas Station (30 分)
程式設計題 1072 Gas Station (30 分) A gas station has to be built at such a location that the minimum distance between the station and any of t
Week12 Gas Station
Week12 Greedy question source: Gas Station question description There are N gas stations along a circular route, where the amount of gas at
[LeetCode] Minimize Max Distance to Gas Station 最小化去加油站的最大距離
On a horizontal number line, we have gas stations at positions stations[0], stations[1], ..., stations[N-1], where N = stations.length. Now, we add
Leetcode 774. Minimize Max Distance to Gas Station
Problem: On a horizontal number line, we have gas stations at positions stations[0], stations[1], ..., stations[N-1], where N = stations.length. Now, we