首页 > 代码库 > 【Leetcode】Remove Duplicates from Sorted Array
【Leetcode】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 A = [1,1,2],
Your function should return length = 2, and A is now [1,2].
双指针的思路，一个指针进行遍历，另外一个指针指向无重复元素数组的最后一个位置的下一个位置。
1st （16 tries）
class Solution {public: int removeDuplicates(int A[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function int i,j,k,count; int length = n; for(i = 0;i < n;++i) { int tmp = A[i]; j = i+1; count = 0; while(A[j] == tmp && j < n) { ++count; ++j; } n -= count; for(k = j;k < length;++k) { A[k-count] = A[k]; } } return n; }};
2nd （two tries）
class Solution {public: int removeDuplicates(int A[], int n) { if(n == 0) return 0; int start = 1; for(int i = 1;i < n;i++) { if(A[i] == A[i-1]) continue; else A[start++] = A[i]; } return start; }};
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。