Miroirs/TheAlgorithms-Ruby
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Ruby synced 2025-01-14 08:01:05 +01:00
Code Issues Projects Releases Packages Wiki Activity

Update and rename arrays_intersection.rb to sorted_arrays_intersection.rb

Browse source
This commit is contained in:
Vitor Oliveira 2021-04-15 18:00:29 -07:00 committed by GitHub
parent da89bae931
commit b101ef25d7
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
data_structures/arrays/arrays_intersection.rb → data_structures/arrays/sorted_arrays_intersection.rb
View file

@ -28,7 +28,7 @@
# @param {Integer[]} arr2 # @param {Integer[]} arr2
# @param {Integer[]} arr3 # @param {Integer[]} arr3
# @return {Integer[]} # @return {Integer[]}
def arrays_intersection(arr1, arr2, arr3) def sorted_arrays_intersection(arr1, arr2, arr3)
result = [] result = []
# prepare three pointers to iterate through three arrays # prepare three pointers to iterate through three arrays
@ -57,11 +57,11 @@ end
arr1 = [1, 2, 3, 4, 5] arr1 = [1, 2, 3, 4, 5]
arr2 = [1, 2, 5, 7, 9] arr2 = [1, 2, 5, 7, 9]
arr3 = [1, 3, 4, 5, 8] arr3 = [1, 3, 4, 5, 8]
print(arrays_intersection(arr1, arr2, arr3)) print(sorted_arrays_intersection(arr1, arr2, arr3))
# Output: [1,5] # Output: [1,5]
arr1 = [197, 418, 523, 876, 1356] arr1 = [197, 418, 523, 876, 1356]
arr2 = [501, 880, 1593, 1710, 1870] arr2 = [501, 880, 1593, 1710, 1870]
arr3 = [521, 682, 1337, 1395, 1764] arr3 = [521, 682, 1337, 1395, 1764]
print(arrays_intersection(arr1, arr2, arr3)) print(sorted_arrays_intersection(arr1, arr2, arr3))
# Output: [] # Output: []