Add leetcode problem 350

Author: lht102

leetcode/src/00350_intersection_of_two_arrays_ii/solution.go

@@ -0,0 +1,29 @@
+package leetcode
+
+import (
+	"slices"
+)
+
+func intersect(nums1 []int, nums2 []int) []int {
+	slices.Sort(nums1)
+	slices.Sort(nums2)
+
+	i := 0
+	j := 0
+	m := len(nums1)
+	n := len(nums2)
+	var res []int
+
+	for i < m && j < n {
+		if nums1[i] < nums2[j] {
+			i++
+		} else if nums1[i] > nums2[j] {
+			j++
+		} else {
+			res = append(res, nums1[i])
+			i++
+			j++
+		}
+	}
+	return res
+}

leetcode/src/00350_intersection_of_two_arrays_ii/solution.rs

@@ -0,0 +1,46 @@
+use std::collections::HashMap;
+
+struct Solution;
+
+impl Solution {
+    pub fn intersect(nums1: Vec<i32>, nums2: Vec<i32>) -> Vec<i32> {
+        let mut freq = nums1
+            .into_iter()
+            .fold(HashMap::<i32, usize>::new(), |mut map, x| {
+                *map.entry(x).or_default() += 1;
+                map
+            });
+        let mut res = Vec::new();
+
+        for num in nums2.iter() {
+            if let Some(cnt) = freq.get_mut(num) {
+                if *cnt > 0 {
+                    res.push(*num);
+                    *cnt -= 1;
+                }
+            }
+        }
+
+        res
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test() {
+        let nums1 = vec![1, 2, 2, 1];
+        let nums2 = vec![2, 2];
+        let mut actual = Solution::intersect(nums1, nums2);
+        actual.sort_unstable();
+        assert_eq!(actual, vec![2, 2]);
+
+        let nums1 = vec![4, 9, 5];
+        let nums2 = vec![9, 4, 9, 8, 4];
+        let mut actual = Solution::intersect(nums1, nums2);
+        actual.sort_unstable();
+        assert_eq!(actual, vec![4, 9]);
+    }
+}

leetcode/src/00350_intersection_of_two_arrays_ii/solution_test.go

@@ -0,0 +1,29 @@
+package leetcode
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+func TestIntersect(t *testing.T) {
+	tests := []struct {
+		nums1 []int
+		nums2 []int
+
+		expected []int
+	}{
+		{[]int{1, 2, 2, 1}, []int{2, 2}, []int{2, 2}},
+		{[]int{4, 9, 5}, []int{9, 4, 9, 8, 4}, []int{4, 9}},
+	}
+
+	for i, tt := range tests {
+		tt := tt
+		t.Run(fmt.Sprintf("Test %d", i), func(t *testing.T) {
+			t.Parallel()
+			actual := intersect(tt.nums1, tt.nums2)
+			assert.ElementsMatch(t, tt.expected, actual)
+		})
+	}
+}

leetcode/src/lib.rs

@@ -1418,3 +1418,6 @@ mod asteroid_collision;
 
 #[path = "01550_three_consecutive_odds/solution.rs"]
 mod three_consecutive_odds;
+
+#[path = "00350_intersection_of_two_arrays_ii/solution.rs"]
+mod intersection_of_two_arrays_ii;