We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 83dea75 commit 637774dCopy full SHA for 637774d
scripts/algorithms/K/K Inverse Pairs Array/K Inverse Pairs Array.js
@@ -1,16 +1,17 @@
1
+// Runtime: 191 ms (Top 53.06%) | Memory: 77.6 MB (Top 21.02%)
2
var kInversePairs = function(n, k) {
3
const dp = new Array(n+1).fill(0).map(el => new Array(k+1).fill(0))
4
const MOD = Math.pow(10, 9) + 7
-
5
+
6
for(let i = 0; i < n+1; i++) {
7
dp[i][0] = 1
8
}
9
10
for(let i = 1; i <= n; i++) {
11
for(let j = 1; j <= k; j++) {
12
dp[i][j] = (dp[i][j-1] + dp[i-1][j] % MOD) - (j >= i ? dp[i-1][j-i] : 0)%MOD
13
14
15
16
return dp[n][k] % MOD
-};
17
+};
0 commit comments