gas-station 贪心

题目描述

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

You have a car with an unlimited gas tank and it costscost[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.

两条重要属性：

1 如果总的gas - cost小于零的话，那么没有解返回-1

2 如果前面所有的gas - cost加起来小于零，那么前面所有的点都不能作为出发点。

实现代码：

   class Solution {
public:
    int canCompleteCircuit(vector<int> &gas, vector<int> &cost) {
        int sum = 0;  
        int total = 0;  
        int j = -1;  
        for(int i = 0; i < gas.size() ; ++i)  
        {  
            sum += gas[i]-cost[i];     //属性2的判断；
            total += gas[i]-cost[i];     //属性1的判断；
            if(sum < 0)  
            {  
                j=i; sum = 0;              //记录位置，第i位之前的所有点不能作为出发点；
            }  
        }  
        if(total<0) return -1;  
        else return j+1;  
    }
};