leetcode刷題 26.remove-duplicates-from-sorted-array.

來源：https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/

 

題目描述

Given a sorted array nums, 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 1:

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 returned length. Example 2:

Given nums = [0,0,1,1,1,2,2,3,3,4],

Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.

 

 

function testF(nums)
	local arr = {}
	local arr1= {}
	for i,v in ipairs(nums) do
		if arr[v] == nil then
			arr[v] = 0
			table.insert(arr1, v)
		end
	end
	print(#arr1)
	return #arr1;
end


local nums = {0,0,1,1,1,2,2,3,3,4};
testF(nums)