[nim4leetcode] 26. remove duplicates from sorted array

Problem

Given a sorted array, remove the duplicates in-place such that each element appear only once and return the new length.

Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.

Example:

Given nums = [1,1,2],

Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively.
It doesn't matter what you leave beyond the new length.

Solution

proc removeDuplicates(nums: var seq[int]): int =
  if nums == nil or nums.len == 0:
    return 0
  var n = 1
  for i in 1 ..< nums.len:
    if nums[i] != nums[i - 1]:
      nums[n] = nums[i]
      n += 1
  result = n

when isMainModule:
  var nums = @[1, 1, 2]
  assert removeDuplicates(nums) == 2
  assert nums[0] == 1 and nums[1] == 2