Miroirs/TheAlgorithms-Ruby
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Ruby synced 2025-01-27 19:58:06 +01:00
Code Issues Projects Releases Packages Wiki Activity

Update data_structures/arrays/intersection.rb

Browse source 
Co-authored-by: Vitor Oliveira <vbrazo@gmail.com>
This commit is contained in:
Jessica Kwok 2021-04-19 15:54:48 -07:00 • committed by GitHub
parent 25d76f8944
commit db2d1b74a2
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 5 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

7
data_structures/arrays/intersection.rb
View file

@ -78,7 +78,10 @@ puts intersect(nums1, nums2)
# #
# Approach 3: Two Pointers # Approach 3: Two Pointers
# #
# Time Complexity: O(n log n) # Complexity analysis:
# Time Complexity: O(nlogn + mlogm), where n and m are the lengths of the arrays. We sort two arrays independently and then do a linear scan.
# Space Complexity: from O(logn+logm) to O(n+m), depending on the implementation of the sorting algorithm.
# #
def intersect(nums1, nums2) def intersect(nums1, nums2)
result = [] result = []
@ -112,4 +115,4 @@ puts intersect(nums1, nums2)
nums1 = [4, 9, 5] nums1 = [4, 9, 5]
nums2 = [9, 4, 9, 8, 4] nums2 = [9, 4, 9, 8, 4]
puts intersect(nums1, nums2) puts intersect(nums1, nums2)
# => [4,9] # => [4,9]