Update minimize-the-total-price-of-the-trips.cpp

Author: kamyu104

C++/minimize-the-total-price-of-the-trips.cpp

@@ -75,7 +75,7 @@ class Solution2 {
             adj[e[1]].emplace_back(e[0]);
         }
         vector<int> lookup(n);
-        const function<bool (int, int, int)> dfs = [&](int u, int p, int target) {
+        const function<bool(int, int, int)> dfs = [&](int u, int p, int target) {
             ++lookup[u];
             if (u == target) {
                 return true;
@@ -92,7 +92,7 @@ class Solution2 {
             return false;
         };
 
-        const function<pair<int, int> (int, int)> dfs2 = [&](int u, int p) {
+        const function<pair<int, int>(int, int)> dfs2 = [&](int u, int p) {
             int full = price[u] * lookup[u], half = price[u] / 2 * lookup[u];
             for (const auto& v : adj[u]) {
                 if (v == p) {