leetcode之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.

解答：

首先很容易理解，想要走完全部最好的就是在每个地方都把所有能加的汽油都加满，这个应该是毋庸置疑的。

其次就是选定起始点，直接线性遍历即可，起始点需要满足gas[i] >= cost[i]

然后就是剪枝，如果从j位置开始，在位置k发现不能继续向前，那么在j到k之间的加油站（包含k）是肯定不能满足的（仔细思考一下就能理解了）

class Solution {
public:
    int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
		int size = gas.size();
		for(int i = 0;i < size;++i)
		{
			if(cost[i] > gas[i])
				continue;
			int curGas = gas[i] - cost[i];
			bool tag = true;
			int j;
			for(j = (i + 1) % size;j != i; j = (j + 1) % size)
			{
				if(curGas + gas[j] - cost[j] < 0)
				{
					tag = false;
					break;
				}
				curGas = curGas + gas[j] - cost[j];
			}
			if(tag)
				return i;
			else
				i = max(i,j);//为了防止由于轮转回到前面已经测试过的点
		}
		return -1;
    }
};