From 81cc1e14696dce24f83dd772e679e1f1b6b33580 Mon Sep 17 00:00:00 2001
From: Lam Haoyin <root@eatswap.org>
Date: Fri, 21 Jan 2022 12:12:07 +0800
Subject: [PATCH] add: description

---
 2201/220121.cpp | 7 +++++++
 1 file changed, 7 insertions(+)

diff --git a/2201/220121.cpp b/2201/220121.cpp
index 241c7a7..c06804f 100644
--- a/2201/220121.cpp
+++ b/2201/220121.cpp
@@ -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) {