【leetcode 数组】Remove Duplicates from Sorted Arrayd
2014-10-25 20:29
411 查看
题目:
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 =
[1,1,2],
Your function should return length =
2,
and A is now
[1,2].
Hide Tags
Array Two
Pointers
分析:
遍历一遍,首先找到与A[0]不等的,放到A[1],再找与A[1]不等的,放到A[2],以此类推代码参考:
class Solution { public: int removeDuplicates(int A[], int n) { if(n==0) return 0; int m=0; for(int i=1;i<n;i++) { if(A[m]!=A[i]) { m++; A[m]=A[i]; } } return m+1; } };
相关文章推荐
- leetcode 题解:Remove Duplicates from Sorted Array(已排序数组去重)
- LeetCode--Remove Duplicates from Sorted Array II (数组操作)
- leetcode 4. 移除有序数组中的重复元素 Remove Duplicates from Sorted Array
- [LeetCode]14. Remove Duplicates from Sorted Array排序数组去重
- [leetcode]【数组】26. Remove Duplicates from Sorted Array
- LeetCode @ Remove Duplicates from Sorted Array 数组去重
- [C++]LeetCode 26: Remove Duplicates from Sorted Array(有序数组去重)
- leetcode:数组:Remove Duplicates from Sorted Array
- [leetcode] 80 Remove Duplicates from Sorted Array II(数组下标操作)
- ※ Leetcode - Array -Remove Duplicates from Sorted Array(就地有序数组去重)
- LeetCode Remove Duplicates from Sorted Array II 删除整型数组中的重复元素并返回剩下元素个数2
- leetcode 排序数组去重复并返回新数组长度Remove Duplicates from Sorted Array
- leetcode 题解:Remove Duplicates from Sorted Array II(已排序数组去三次及以上重复元素)
- 【LeetCode-面试算法经典-Java实现】【026-Remove Duplicates from Sorted Array(删除排序数组中的重复元素)】
- LeetCode @ Remove Duplicates from Sorted ArrayII 数组去重II
- [LeetCode] Remove Duplicates from Sorted Array 有序数组中去除重复项
- [LeetCode] Remove Duplicates from Sorted Array II 有序数组中去除重复项之二
- Remove Duplicates from Sorted Array II 从有序数组里移除重复出现元素,最多重复出现2次 @LeetCode
- leetcode:Remove Duplicates from Sorted Array(去掉数组重复数字,常数空间限制)【面试算法题】
- leetcode 26. Remove Duplicates from Sorted Array-数组去重|双指针