diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/count_all_pickup_delivery.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/count_all_pickup_delivery.cpp')
-rw-r--r-- | other/count_all_pickup_delivery.cpp | 23 |
1 files changed, 23 insertions, 0 deletions
diff --git a/other/count_all_pickup_delivery.cpp b/other/count_all_pickup_delivery.cpp new file mode 100644 index 0000000..0d82d5a --- /dev/null +++ b/other/count_all_pickup_delivery.cpp @@ -0,0 +1,23 @@ +#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); +} |