diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/count_all_pickup_delivery.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/count_all_pickup_delivery.cpp')
-rw-r--r-- | other/count_all_pickup_delivery.cpp | 23 |
1 files changed, 0 insertions, 23 deletions
diff --git a/other/count_all_pickup_delivery.cpp b/other/count_all_pickup_delivery.cpp deleted file mode 100644 index 0d82d5a..0000000 --- a/other/count_all_pickup_delivery.cpp +++ /dev/null @@ -1,23 +0,0 @@ -#include "leetcode.h" -#define lli long long int - -class Solution { -public: - int countOrders(int n) { - lli mod = 1e9 + 7; - vector<lli> dp(n + 2); - dp[1] = 1; - dp[2] = 6; - for (lli i = 3; i <= n; i++) { - lli x = 2 * i - 1; - lli combs = x * (x + 1) / 2; - dp[i] = (dp[i - 1] * combs) % mod; - } - return dp[n]; - } -}; - -int main() { - Solution obj; - cout << obj.countOrders(2); -} |