LeetCode 134 加油站

加油站

class Solution {
public:
    int canCompleteCircuit(vector<int>& gas, vector<int>& cost) 
{
	//使用贪心算法
	int len1 = gas.size();
	int result = 0;
	int current = 0;
	vector<int> lujing(len1, 0);
	int i;
	for (i = 0; i<len1; ++i)
	{
		int j;
		for ( j= i; j <= (len1 - 1 + i); ++j)
		{
			int k = j%len1;
			if (current + gas[k] < cost[k])
			{
				break;

			}
			current = current + gas[k]-cost[k];
		}
        current=0;
		if (j == len1 + i)
			break;
	}
	if (i == len1)
		return -1;
	else
		return i;
}
};