26. Remove Duplicates from Sorted Array
Posted 米开朗菠萝
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了26. Remove Duplicates from Sorted Array相关的知识,希望对你有一定的参考价值。
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 in place with constant memory.
For example,
Given input array 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.
1 int removeDuplicates(int* nums, int numsSize) { 2 int i,j; 3 i = j = 0; 4 if(numsSize == 0) 5 return 0; 6 for(i = 0; i < numsSize; i++) 7 { 8 if(nums[i] != nums[j]) 9 nums[++j] = nums[i]; 10 } 11 return j+1; 12 }
以上是关于26. Remove Duplicates from Sorted Array的主要内容,如果未能解决你的问题,请参考以下文章
26. Remove Duplicates from Sorted Array
26. Remove Duplicates from Sorted Array
#26 Remove Duplicates from Sorted Array
LeetCode OJ 26. Remove Duplicates from Sorted Array
leetcode 26. Remove Duplicates from Sorted Array 80. Remove Duplicates from Sorted Array II