编程练习（第九周）

题目来源于：https://leetcode.com

134. Gas Station

Add to List

DescriptionHintsSubmissionsSolutions

• Total Accepted: 81981
• Total Submissions: 283411
• Difficulty: Medium
• Contributor: LeetCode

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.

题解：

    int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {        for(int i = 0; i < gas.size(); i++) {            gas[i] -= cost[i];        }        int sum = 0;        int result = 0;        int n = gas.size();        for(int i = 0; i < n * 2 - 1; i++) {            sum += gas[i % n];            if(sum < 0) {                result = i + 1;                if(result >= n) {                    return -1;                }                sum = 0;            }        }        return result;    }