LeetCode Gas Station

最新推荐文章于 2023-05-29 15:50:15 发布

kassical

最新推荐文章于 2023-05-29 15:50:15 发布

阅读量554

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/kassical/article/details/38950381

版权

LeetCode 专栏收录该内容

98 篇文章 0 订阅

订阅专栏

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.

Note:

The solution is guaranteed to be unique.

class Solution {
public:
	int canCompleteCircuit(vector<int> &gas, vector<int> &cost) {
		unsigned numOfStation = gas.size();
		if (numOfStation == 0)
			return -1;

		for (int i = 0; i < numOfStation; ++i) {
			int curval = 0;
			int curCount = 0;
			for (int j = i; j < i + numOfStation; ++j) {
				int temp = j % numOfStation;
				curval += gas[temp] - cost[temp];
				
				if (curval < 0) {
					break;
				}

				++curCount;
			}

			if (curCount == numOfStation) {
				return i;
			}
		}

		return -1;
	}
};