Eatswap
/
leetcode-daily
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

add: description

This commit is contained in:
Lam Haoyin 2022-01-21 12:12:07 +08:00
parent 67f07d0b84
commit 81cc1e1469
No known key found for this signature in database
GPG Key ID: 8C089CB1A2B7544F
1 changed files with 7 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
2201/220121.cpp
View File

@ -1,6 +1,13 @@
#include <vector>
#include <iostream>
/**
* 134. Gas Station
* There are n gas stations along a circular route, where the amount of gas at the ith station is gas[i].
* You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from the ith station to its next (i + 1)th station. You begin the journey with an empty tank at one of the gas stations.
* Given two integer arrays gas and cost, return the starting gas station's index if you can travel around the circuit once in the clockwise direction, otherwise return -1. If there exists a solution, it is guaranteed to be unique
*/
class Solution {
public:
static int canCompleteCircuit(const std::vector<int>& gas, const std::vector<int>& cost) {