1575 solved.

Author: liuyubobobo

1501-2000/1575-Count-All-Possible-Routes/cpp-1575/CMakeLists.txt

@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.25)
+project(cpp_1575)
+
+set(CMAKE_CXX_STANDARD 17)
+
+add_executable(cpp_1575 main.cpp)

1501-2000/1575-Count-All-Possible-Routes/cpp-1575/main.cpp

@@ -0,0 +1,48 @@
+/// Source : https://leetcode.com/problems/count-all-possible-routes/description/
+/// Author : liuyubobobo
+/// Time   : 2023-06-25
+
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+
+/// Memoization
+/// Time Complexity: O(n^2 * fuel)
+/// Space Complexity: O(n * fuel)
+class Solution {
+
+private:
+    long long MOD = 1e9 + 7;
+
+public:
+    int countRoutes(vector<int>& locations, int start, int finish, int fuel) {
+
+        int n = locations.size();
+        vector<vector<long long>> dp(n, vector<long long>(fuel + 1, -1));
+        return dfs(n, locations, finish, start, fuel, dp);
+    }
+
+private:
+    long long dfs(int n, const vector<int>& locations, int finish, int cur, int fuel,
+                         vector<vector<long long>>& dp){
+
+        if(fuel < 0) return 0;
+        if(dp[cur][fuel] != -1) return dp[cur][fuel];
+
+        long long res = 0;
+        if(cur == finish) res = 1;
+        for(int i = 0; i < n; i ++){
+            if(i == cur) continue;
+            res += dfs(n, locations, finish, i, fuel - abs(locations[i] - locations[cur]), dp);
+        }
+        return dp[cur][fuel] = res % MOD;
+    }
+};
+
+
+int main() {
+
+    return 0;
+}

readme.md

@@ -1475,7 +1475,7 @@ email: [[email protected]](mailto:[email protected])
 | 1572 | [Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/) | [无] | [C++](1501-2000/1572-Matrix-Diagonal-Sum/cpp-1572/) | | |
 | | | | | | |
 | 1574 | [Shortest Subarray to be Removed to Make Array Sorted](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/description/) | [无] | [C++](1501-2000/1574-Shortest-Subarray-to-be-Removed-to-Make-Array-Sorted/cpp-1574/) | | |
-| | | | | | |
+| 1575 | [Count All Possible Routes](https://leetcode.com/problems/count-all-possible-routes/description/) | [无] | [C++](1501-2000/1575-Count-All-Possible-Routes/cpp-1575/) | | |
 | 1576 | [Replace All ?'s to Avoid Consecutive Repeating Characters](https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/) | [无] | [C++](1501-2000/1576-Replace-All-Question-Marks-to-Avoid-Consecutive-Repeating-Characters/cpp-1576/) | | |
 | 1577 | [Number of Ways Where Square of Number Is Equal to Product of Two Numbers](https://leetcode.com/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers/) | [无] | [C++](1501-2000/1577-Number-of-Ways-Where-Square-of-Number-Is-Equal-to-Product-of-Two-Numbers/cpp-1577/) | | |
 | 1578 | [Minimum Deletion Cost to Avoid Repeating Letters](https://leetcode.com/problems/minimum-deletion-cost-to-avoid-repeating-letters/) | [无] | [C++](1501-2000/1578-Minimum-Deletion-Cost-to-Avoid-Repeating-Letters/cpp-1578/) | | |