# 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.

int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
int lenG = gas.size();
int lenC = cost.size();
if(lenG == 0 || lenC == 0 || (lenG != lenC))
{
return -1;
}

int sum = 0;
vector<int> diff;
int tmp = 0;
for(int i = 0; i < lenG; ++i)
{
tmp = gas[i] - cost[i];
diff.push_back(tmp);
sum += tmp;
}

if(sum < 0)
return -1;
int index = 0;
for(int i = 0; i < lenG; ++i)
{
int tmpSum = diff[i];
if(tmpSum < 0)
continue;
int flag = 1;
for(int j = i + 1; j < lenG; ++j)
{
tmpSum += diff[j];
if(tmpSum < 0)
{
flag = 0;
i = j;
break;
}
}

if(flag)
{
index = i;
break;
}
}

return index;
}

• 本文已收录于以下专栏：

## LeetCode Gas Station 两个特性，两种方法完美解答-更新证明方法

• kenden23
• 2013年11月03日 17:07
• 17907

## [leetcode] 【数组】134. Gas Station

There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. ...

## Leetcode——134. Gas Station && 435. Non-overlapping Intervals

Gas Station 1. 问题描述 有N个加油站围成一个圈，第i个加油站的油量是gas[i]，一辆车有一个无限量的油箱，每次从第i个加油站开到第i+1个加油站需要消耗cost[i]的油量。车一开始...

## [LeetCode] Gas Station，转化为求最大序列的解法，和更简单简单的Jump解法。

LeetCode上 Gas Station是比较经典的一题，它的魅力在于算法足够优秀的情况下，代码可以简化到非常简洁的程度。 原题如下 Gas Station There are N...

## Gas Station leetcode

There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. ...

## leetcode134. Gas Station

134. Gas StationThere are N gas stations along a circular route, where the amount of gas at station ...

## 1072. Gas Station (30)

1072. Gas Station (30) #include #include #include using namespace std; class CA { public: enum{...

举报原因： 您举报文章：Gas Station 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)