leetcode 629 K Inverse Pairs Array

问题描述：

Given two integers n and k, find how many different arrays consist of numbers from 1 to n such that there are exactly k inverse pairs.

We define an inverse pair as following: For ith and jth element in the array, if i < j and a[i] > a[j] then it’s an inverse pair; Otherwise, it’s not.

Since the answer may very large, the answer should be modulo 10⁹ + 7.

Example 1:

Input: n = 3, k = 0
Output: 1
Explanation: 
Only the array [1,2,3] which consists of numbers from 1 to 3 has exactly 0 inverse pair.

Example 2:

Input: n = 3, k = 1
Output: 2
Explanation: 
The array [1,3,2] and [2,1,3] have exactly 1 inverse pair.

Note:

1. The integer n is in the range [1, 1000] and k is in the range [0, 1000].

这种当有n时只需要求存在多少种情况而不需要枚举具体的问题通常是利用动态规划方法。从n递推到n+1。分析如下：
f(n,k)表示n个连续数的全排列中存在k个逆序对的排列数。假设f(n,k)具体表现为0<=s1,s2,….,sn<=n，则f(n+1,k)则可以在s1,s2,…,sn后面加上n+1,其中n+1>n>=s1,s2,….sn，此时并没有增加逆序对的个数，仍然是k个。同样，如果在f(n,k-1)的排列中将n+1放在最后一个数前面，则增加一个逆序对，从而使得在n+1的情况下存在k个逆序对。注意，在乡下递推的过程中需要考虑如果在n+1的情况下k的取值可能会远大于n，此时，f(n+1,k)=f(n,k)+f(n,k-1)+….+f(n,max(0,k-n))。
为了降低时间复杂度，在求f(n,k)+f(n,k-1)+….+f(n,max(0,k-n))的过程中可以利用之前的求和结果计算。
代码如下：

public int kInversePairs(int n, int k) {
    int mo=1000000007;
        int[][] f=new int[1002][1002];
        f[1][0]=1;
        for (int i=2;i<=n;i++)
        {
            f[i][0]=1;
            for (int j=1;j<=k;j++) 
            {
                f[i][j]=(f[i][j-1]+f[i-1][j])%mo;
                if (j>=i) f[i][j]=(f[i][j]-f[i-1][j-i]+mo)%mo;
            }
        }
        return f[n][k];
}