線性資料結構 --- array (1)

只有不斷學習,練習,,複習才會越來越厲害
因此，開始記錄依照不同資料結構搭配Leetcode來練習
方便未來可以隨時拿來複習


Leetcode出處 : https://leetcode.com/problems/remove-duplicates-from-sorted-array/

             Remove Duplicates from Sorted Array

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.


Sample Code (C++)

	class Solution {
	public:
	int removeDuplicates(vector<int>& nums) {
	int length = nums.size();
	int index = 1;
	if (length == 0)
	return 0;
	for(int i=1; i<length; i++) {
	if (nums[i] != nums[i-1])
	nums[index++] = nums[i];
	}
	return index;
	}
	};

view raw .cpp hosted with ❤ by GitHub