jackfiled/leetcode
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

20241024 finished.

Browse Source
This commit is contained in:
jackfiled
2024-10-24 09:08:13 +08:00
parent 3102da99a8
commit bce8de1c85
266 changed files with 2321 additions and 2014 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
src/problem/p3193_count_the_number_of_inversions.rs
View File

@@ -3,7 +3,6 @@
*/
pub struct Solution {}
// submission codes start here
use std::collections::HashMap;
@@ -36,7 +35,12 @@ impl Solution {
}
}
fn dfs(end: usize, count: usize, requirements: &HashMap<usize, usize>, dp: &mut Vec<Vec<i32>>) -> i32 {
fn dfs(
end: usize,
count: usize,
requirements: &HashMap<usize, usize>,
dp: &mut Vec<Vec<i32>>,
) -> i32 {
if end == 0 {
return 1;
}
@@ -75,8 +79,17 @@ mod tests {
#[test]
fn test_3193() {
assert_eq!(1, Solution::number_of_permutations(2, vec![vec![1, 1]]));
assert_eq!(2, Solution::number_of_permutations(3, vec![vec![2, 2], vec![0, 0]]));
assert_eq!(1, Solution::number_of_permutations(3, vec![vec![2, 2], vec![1, 1], vec![0, 0]]));
assert_eq!(1, Solution::number_of_permutations(2, vec![vec![0, 0], vec![1, 0]]));
assert_eq!(
2,
Solution::number_of_permutations(3, vec![vec![2, 2], vec![0, 0]])
);
assert_eq!(
1,
Solution::number_of_permutations(3, vec![vec![2, 2], vec![1, 1], vec![0, 0]])
);
assert_eq!(
1,
Solution::number_of_permutations(2, vec![vec![0, 0], vec![1, 0]])
);
}
}