Add solution #134

JoshCrozier · JoshCrozier · commit 984c931c00c8 · 2023-01-06T20:16:54.000-06:00
diff --git a/0134-gas-station.js b/0134-gas-station.js
@@ -0,0 +1,34 @@
+/**
+ * 134. Gas Station
+ * https://leetcode.com/problems/gas-station/
+ * Difficulty: Medium
+ *
+ * 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
+ */
+
+/**
+ * @param {number[]} gas
+ * @param {number[]} cost
+ * @return {number}
+ */
+var canCompleteCircuit = function(gas, cost) {
+  let total = 0, tank = 0, index = 0;
+
+  for (let i = 0; i < gas.length; i++) {
+    tank += gas[i] - cost[i];
+    total += gas[i] - cost[i];
+    if (tank < 0) {
+      tank = 0;
+      index = i + 1;
+    }
+  }
+
+  return total >= 0 ? index : -1;
+};
diff --git a/README.md b/README.md
@@ -78,6 +78,7 @@
 121|[Best Time to Buy and Sell Stock](./0121-best-time-to-buy-and-sell-stock.js)|Easy|
 128|[Longest Consecutive Sequence](./0128-longest-consecutive-sequence.js)|Medium|
 133|[Clone Graph](./0133-clone-graph.js)|Medium|
+134|[Gas Station](./0134-gas-station.js)|Medium|
 136|[Single Number](./0136-single-number.js)|Easy|
 141|[Linked List Cycle](./0141-linked-list-cycle.js)|Easy|
 142|[Linked List Cycle II](./0142-linked-list-cycle-ii.js)|Medium|
