Leetcode | K Inverse Pairs Array
来源:互联网 发布:知乎 国际政治 编辑:程序博客网 时间:2024/06/05 09:12
原题链接:https://leetcode.com/problems/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 be very large, the answer should be modulo 109 + 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:
The integer n is in the range [1, 1000] and k is in the range [0, 1000].
由题意我们可以看出,这道题是明显的DP问题,所以找出动态规划方程是问题的关键,从子问题到原问题的就是利用下面这个例子的原理,如下
For example,
if we have some permutation of 1…45 x x x x creates 4 new inverse pairs
x 5 x x x creates 3 new inverse pairs
…
x x x x 5 creates 0 new inverse pairs
所以根据上述原理我们可以得出动态规划方程为
dp[n][k] //represent the number of permutations of (1…n) with k inverse pairs.
dp[i][j] = dp[i-1][j] + dp[i-1][j-1] + dp[i-1][j-2] + ….. +dp[i-1][j - i + 1]
根据上述方程,源代码如下所示:
class Solution {public: int kInversePairs(int n, int k) { vector<vector<int>> dp(n+1, vector<int>(k+1)); dp[0][0] = 1; for(int i = 1; i <= n; ++i){ dp[i][0] = 1; for(int j = 1; j <= k; ++j){ dp[i][j] = (dp[i][j-1] + dp[i-1][j]) % mod; if(j - i >= 0){ dp[i][j] = (dp[i][j] - dp[i-1][j-i] + mod) % mod; } } } return dp[n][k]; }private: const int mod = pow(10, 9) + 7;};
- leetcode:K inverse pairs array
- K Inverse Pairs Array (leetcode)
- Leetcode | K Inverse Pairs Array
- 【LeetCode】629. K Inverse Pairs Array
- leetcode 629 K Inverse Pairs Array
- leetcode 629. K Inverse Pairs Array
- [leetcode]629. K Inverse Pairs Array
- K Inverse Pairs Array
- K Inverse Pairs Array
- 629. K Inverse Pairs Array
- 629. K Inverse Pairs Array
- 629. K Inverse Pairs Array
- 629. K Inverse Pairs Array
- 629. K Inverse Pairs Array
- 629. K Inverse Pairs Array 自制答案
- leetcode 629. K Inverse Pairs Array K个逆序对 + 动态规划DP
- 第十九周:( LeetCode629) K Inverse Pairs Array(c++)
- LeetCode K-diff Pairs in an Array
- Cmder使用总结
- extern关键字
- Spring Cloud 实践(一):Spring Cloud 介绍
- 如何安装WindowBuilder以及简单的使用
- EasyUI 手风琴
- Leetcode | K Inverse Pairs Array
- 三种方法:1472 Problem B选票统计(一)(结构体专题)——软四课堂小测试2——2017-12-22
- Tensorflow基础
- python中import理解
- SpringBoot拦截器和自定义注解验证是否登录
- 我在IT职场超15年:从程序员做到副总,送你21个超实用的职场法则!
- HTTP & HTTPS网络协议重点总结(基于SSL/TLS的握手、TCP/IP协议基础、加密学)
- Codeforces Round #350 (Div. 2)
- Mac下安装用于处理图片库Pillow