Miroirs/TheAlgorithms-Ruby
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Ruby synced 2024-12-26 21:58:56 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions

Remove Element: two pointers approach

Browse source
This commit is contained in:
Vitor Oliveira 2021-03-15 21:41:43 -07:00
parent 780c324417
commit ad35c2398c
1 changed files with 27 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

29
data_structures/arrays/remove_elements.rb
View file

@ -1,7 +1,7 @@
# Arrays - Remove Elements
#
# Given an array nums and a value val, remove all instances of that value in-place and return the new length.
# Do not allocate extra space for another array,
# Do not allocate extra space for another array,
# you must do this by modifying the input array in-place with O(1) extra memory.
# The order of elements can be changed. It doesn't matter what you leave beyond the new length.
#
@ -37,7 +37,7 @@ def remove_elements(nums, val)
result_length = nums.length
shift_length = 0
nums.each_with_index do |num, i|
if num == val
if num == val
nums.delete_at(i)
nums.unshift('removed')
result_length -=1
@ -52,3 +52,28 @@ puts remove_elements([3,2,2,3], 3)
# => 2
puts remove_elements([0,1,2,2,3,0,4,2], 2)
# => 5
#
# Approach 3: Two-pointer
#
def remove_element(nums, val)
pointer1 = 0
pointer2 = nums.length
while pointer1 < pointer2
if nums[pointer1] == val
nums[pointer1] = nums[pointer2 - 1]
pointer2 -= 1
else
pointer1 += 1
end
end
pointer1
end
puts remove_elements([3,2,2,3], 3)
# => 2
puts remove_elements([0,1,2,2,3,0,4,2], 2)
# => 5