Update minimum-cost-to-reach-destination-in-time.cpp

kamyu104 · web-flow · commit 03481e25cec2 · 2021-08-23T17:03:14.000+08:00
diff --git a/C++/minimum-cost-to-reach-destination-in-time.cpp b/C++/minimum-cost-to-reach-destination-in-time.cpp
@@ -16,6 +16,7 @@ class Solution {
         }
         
         unordered_map<int, int> best;
+        best[0] = 0;
         using T = tuple<int, int, int>;
         priority_queue<T, vector<T>, greater<T>> min_heap;
         min_heap.emplace(passingFees[0], 0, 0);

Original file line number	Diff line number	Diff line change
`@@ -16,6 +16,7 @@ class Solution {`
`16`	`16`	`}`
`17`	`17`
`18`	`18`	`unordered_map<int, int> best;`
	`19`	`+ best[0] = 0;`
`19`	`20`	`using T = tuple<int, int, int>;`
`20`	`21`	`priority_queue<T, vector<T>, greater<T>> min_heap;`
`21`	`22`	`min_heap.emplace(passingFees[0], 0, 0);`