feat: add solution for gas station

Author: bujosa

src/medium/gas_station.rs

@@ -0,0 +1,29 @@
+#![allow(dead_code)]
+pub fn can_complete_circuit(gas: Vec<i32>, cost: Vec<i32>) -> i32 {
+    if gas.iter().sum::<i32>() < cost.iter().sum::<i32>() {
+        return -1;
+    }
+
+    let mut cur_sum = 0;
+    let mut res = 0;
+    for i in 0..gas.len() {
+        cur_sum += gas[i] - cost[i];
+        if cur_sum < 0 {
+            cur_sum = 0;
+            res = i + 1;
+        }
+    }
+
+    res as i32
+}
+
+#[test]
+fn test_can_complete_circuit() {
+    let gas = vec![1, 2, 3, 4, 5];
+    let cost = vec![3, 4, 5, 1, 2];
+    assert_eq!(can_complete_circuit(gas, cost), 3);
+
+    let gas = vec![2, 3, 4];
+    let cost = vec![3, 4, 3];
+    assert_eq!(can_complete_circuit(gas, cost), -1);
+}

src/readme.md

@@ -76,7 +76,7 @@
   - [x] [130. Surrounded regions](../src/medium/surrounded_regions.rs) -> [Problem Description](../src/medium/readme.md#130-surrounded-regions)
   - [x] [131. Palindrome partitioning](../src/medium/palindrome_partitioning.rs) -> [Problem Description](../src/medium/readme.md#131-palindrome-partitioning)
   - [x] [133. Clone graph](../src/medium/clone_graph.rs) -> [Problem Description](../src/medium/readme.md#133-clone-graph)
-  - [ ] [134. Gas station](../src/medium/gas_station.rs) -> [Problem Description](../src/medium/readme.md#134-gas-station)
+  - [x] [134. Gas station](../src/medium/gas_station.rs) -> [Problem Description](../src/medium/readme.md#134-gas-station)
   - [x] [138. Copy list with random pointer PYTHON Solution](../alternative/medium/copy_list_with_random_pointer.py) -> [Problem Description](../src/medium/readme.md#138-copy-list-with-random-pointer)
   - [x] [139. Word break](../src/medium/word_break.rs) -> [Problem Description](../src/medium/readme.md#139-word-break)
   - [x] [143. Reorder list](../src/medium/reorder_list.rs) -> [Problem Description](../src/medium/readme.md#143-reorder-list)

theory/categories/7.greedy/readme.md

@@ -18,7 +18,7 @@ Greedy algorithms are implemented using a greedy function that makes the best ch
 - [x] [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Medium | [Solution](../../../src/medium/maximum_subarray.rs) | [Problem Description](../../../src/medium/readme.md#53-maximum-subarray)
 - [x] [Jump Game](https://leetcode.com/problems/jump-game/) | Medium | [Solution](../../../src/medium/jump_game.rs) | [Problem Description](../../../src/medium/readme.md#55-jump-game)
 - [x] [Jump Game II](https://leetcode.com/problems/jump-game-ii/) | Medium | [Solution](../../../src/medium/jump_game_ii.rs) | [Problem Description](../../../src/medium/readme.md#45-jump-game-ii)
-- [ ] [Gas Station](https://leetcode.com/problems/gas-station/) | Medium | [Solution](../../../src/medium/gas_station.rs) | [Problem Description](../../../src/medium/readme.md#134-gas-station)
+- [x] [Gas Station](https://leetcode.com/problems/gas-station/) | Medium | [Solution](../../../src/medium/gas_station.rs) | [Problem Description](../../../src/medium/readme.md#134-gas-station)
 - [ ] [Hand of Straights](https://leetcode.com/problems/hand-of-straights/) | Medium | [Solution](../../../src/medium/hand_of_straights.rs) | [Problem Description](../../../src/medium/readme.md#846-hand-of-straights)
 - [ ] [Merge Triplets to Form Target Triplet](https://leetcode.com/problems/merge-triplets-to-form-target-triplet/) | Medium | [Solution](../../../src/medium/merge_triplets_to_form_target_triplet.rs) | [Problem Description](../../../src/medium/readme.md#1899-merge-triplets-to-form-target-triplet)
 - [ ] [Partition Labels](https://leetcode.com/problems/partition-labels/) | Medium | [Solution](../../../src/medium/partition_labels.rs) | [Problem Description](../../../src/medium/readme.md#763-partition-labels)