leetcode-26 Remove Duplicates from Sorted Array
來源:程序員人生 發(fā)布時間:2015-08-17 09:17:37 閱讀次數(shù):3474次
問題描寫:
Givena sorted array, remove the duplicates in place such that each element appearonly once and return the new length.
Do not allocate extra space for another array, youmust do this in place with constant memory.
For example,
Given input array A = [1,1,2],
Your function should return length = 2,
and A isnow [1,2].
問題分析:使用1個count統(tǒng)計不同的元素個數(shù),然后注意A[count] = A[i]來消除重復元素便可
代碼:
public class Solution {
public int removeDuplicates(int[] A) {
if(A == null || A.length == 0)
return 0;
int count = 1;
for(int i = 1; i < A.length; i++)
{
if(A[i] != A[i - 1])
{
//更新A[count]
A[count] = A[i];
//更新count
count ++;
}
}
return count;
}
}
生活不易,碼農(nóng)辛苦
如果您覺得本網(wǎng)站對您的學習有所幫助,可以手機掃描二維碼進行捐贈