454. 4Sum II Medium

1/**
2 * [454] 4Sum II
3 *
4 * Given four integer arrays nums1, nums2, nums3, and nums4 all of length n, return the number of tuples (i, j, k, l) such that:
5 * 
6 * 	0 <= i, j, k, l < n
7 * 	nums1[i] + nums2[j] + nums3[k] + nums4[l] == 0
8 * 
9 *  
10 * Example 1:
11 * 
12 * Input: nums1 = [1,2], nums2 = [-2,-1], nums3 = [-1,2], nums4 = [0,2]
13 * Output: 2
14 * Explanation:
15 * The two tuples are:
16 * 1. (0, 0, 0, 1) -> nums1[0] + nums2[0] + nums3[0] + nums4[1] = 1 + (-2) + (-1) + 2 = 0
17 * 2. (1, 1, 0, 0) -> nums1[1] + nums2[1] + nums3[0] + nums4[0] = 2 + (-1) + (-1) + 0 = 0
18 * 
19 * Example 2:
20 * 
21 * Input: nums1 = [0], nums2 = [0], nums3 = [0], nums4 = [0]
22 * Output: 1
23 * 
24 *  
25 * Constraints:
26 * 
27 * 	n == nums1.length
28 * 	n == nums2.length
29 * 	n == nums3.length
30 * 	n == nums4.length
31 * 	1 <= n <= 200
32 * 	-2^28 <= nums1[i], nums2[i], nums3[i], nums4[i] <= 2^28
33 * 
34 */
35pub struct Solution {}
36
37// problem: https://leetcode.com/problems/4sum-ii/
38// discuss: https://leetcode.com/problems/4sum-ii/discuss/?currentPage=1&orderBy=most_votes&query=
39
40// submission codes start here
41
42impl Solution {
43    pub fn four_sum_count(nums1: Vec<i32>, nums2: Vec<i32>, nums3: Vec<i32>, nums4: Vec<i32>) -> i32 {
44        0
45    }
46}
47
48// submission codes end
49
50#[cfg(test)]
51mod tests {
52    use super::*;
53
54    #[test]
55    fn test_454() {
56    }
57}
58