Categorygithub.com/szhou12/leetcode-goleetcode0349-Intersection-of-Two-Arrays
package
0.0.0-20241220224003-b7cf03a90b2b
Repository: https://github.com/szhou12/leetcode-go.git
Documentation: pkg.go.dev
Overview
Dependencies
0
Dependents
0

# README

349. Intersection of Two Arrays

Solution idea

HashMap

  • 注意：输出每个值只能有且一个，所以需要去重

Time complexity = O(max{m, n}) where $m=$ length of nums1, $n=$ length of nums2