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/k_inverse_pairs.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/k_inverse_pairs.cpp')
-rw-r--r-- | other/k_inverse_pairs.cpp | 24 |
1 files changed, 0 insertions, 24 deletions
diff --git a/other/k_inverse_pairs.cpp b/other/k_inverse_pairs.cpp deleted file mode 100644 index 5601d19..0000000 --- a/other/k_inverse_pairs.cpp +++ /dev/null @@ -1,24 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int kInversePairs(int n, int k) { - vector<int> dp(k + 1, 0); - int mod = 1e9 + 7; - for (int i = 1; i <= n; i++) { - vector<int> tmp(k + 1, 0); - tmp[0] = 1; - for (int j = 1; j <= k; j++) { - long long val = (dp[j] + mod - ((j - i) >= 0 ? dp[j - i] : 0)) % mod; - tmp[j] = (tmp[j - 1] + val) % mod; - } - dp = tmp; - } - return (dp[k] + mod - (k > 0 ? dp[k - 1] : 0)) % mod; - } -}; - -int main() { - Solution obj; - cout << obj.kInversePairs(3, 0); -} |