Leetcode 134 Gas Station（环形最大连续和）

题目连接：Leetcode 134 Gas Station

解题思路：目标可以转换为从哪个位置开始，可以获得连续最长的净Gas收入。

class Solution {
	public:
		int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
			int n = gas.size();
			int sumOfGas = 0, sumOfCost = 0;
			for (int i = 0; i < n; i++) {
				sumOfGas += gas[i];
				sumOfCost += cost[i];
			}
			if (sumOfGas < sumOfCost) return -1;

			int ans = 0, pos = -1, sum = 0;
			for (int i = 0; i < n; i++) {
				sum += cost[i] - gas[i];
				if (pos == -1 || sum > ans) {
					pos = i;
					ans = sum;
				}
				sum = max(sum, 0);
			}

			ans = sumOfGas - sumOfCost + ans;
			sum = 0;
			for (int i = n-1; i >= 0; i--) {
				sum += gas[i] - cost[i];
				if (pos == -1 || sum > ans) {
					pos = i-1;
					ans = sum;
				}
				sum = max(sum, 0);
			}

			return (pos + 1) % n;
		}
};