LeetCode: Gas Station

这题跟前面做过的一题挺像

class Solution {
public:
    int canCompleteCircuit(vector<int> &gas, vector<int> &cost) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        int leftsum, sum, beg;
        beg = sum = leftsum = 0;
        for (int i = 0; i < gas.size(); i++) {
            sum += gas[i] - cost[i];
            if (sum < 0) {
                leftsum += sum;
                sum = 0;
                beg = i + 1;
            }
        }
        if (sum + leftsum >= 0) return beg;
        else return -1;
    }
};

 C#

public class Solution {
    public int CanCompleteCircuit(int[] gas, int[] cost) {
        int leftSum = 0, sum = 0, beg = 0;
        for (int i = 0; i < gas.Length; i++) {
            sum += gas[i] - cost[i];
            if (sum < 0) {
                leftSum += sum;
                sum = 0;
                beg = i + 1;
            }
        }
        if (sum + leftSum >= 0) return beg;
        else return -1;
    }
}