RemoveDuplicatesfromSortedArray
2014-10-16 22:08
309 查看
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 A =
Your function should return length =
public class Solution {
public int removeDuplicates(int[] A) {
int j=1;//快慢指针,快指针寻到不同的元素时,慢指针才动
if(A==null)return 0;
if(A.length<=1)return A.length;
for( int i=1;i<A.length;++i){
if(A[i]!=A[i-1]){
A[j++]=A[i];
}
}
return j;
}
}
Do not allocate extra space for another array, you must do this in place with constant memory.
For example,
Given input array A =
[1,1,2],
Your function should return length =
2, and A is now
[1,2].
public class Solution {
public int removeDuplicates(int[] A) {
int j=1;//快慢指针,快指针寻到不同的元素时,慢指针才动
if(A==null)return 0;
if(A.length<=1)return A.length;
for( int i=1;i<A.length;++i){
if(A[i]!=A[i-1]){
A[j++]=A[i];
}
}
return j;
}
}
相关文章推荐
- LeetCode removeDuplicatesFromSortedArray两种解法方法
- LeetCode(81)RemoveDuplicatesfromSortedArrayII
- RemoveDuplicatesfromSortedArray
- 26.RemoveDuplicatesfromSortedArray
- leetcode- RemoveDuplicatesfromSortedArray
- RemoveDuplicate from sorted Array
- 2.2.5 RemoveDuplicatesfromSortedListII.h
- 26RemoveDuplicatesfromSortedArray
- RemoveDuplicatesFromSortedListII
- Removed Duplicates from Sorted Array
- RemoveDuplicate from sorted ArrayII
- 2.2.4RemoveDuplicatesfromSortedList
- RemoveDuplicatesFromSortedArrayI II,移除有序数组里的重复元素以及移除数组里的某个元素
- leetcode26.RemoveDuplicatesfromSortedArray
- leetcode题解-80 Remove Duplicates from Sorted Array II
- Leetcode: Remove Duplicates from Sorted Array I and II
- LeetCode - Remove Duplicates from Sorted Array
- Remove Duplicates from Sorted Array
- 26. Remove Duplicates from Sorted Array
- leetcode26 Remove Duplicates from Sorted Array 去重已排序列表