# leetCode 26. Remove Duplicates from Sorted Array 数组

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.

class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if (nums.empty() || nums.size() == 1)
return nums.size();
int cur = nums[0];
int i = 0;
while(i != nums.size() - 1 )
{
if(cur == nums[i+1])
{
nums.erase(nums.begin() + i + 1);
}
else
{
cur = nums[i+1];
i++;
}
}
return nums.size();
}
};

int count = 0;
for (int i = 1; i < n; i++){
if (A[i] == A[i - 1]) count++;
else A[i - count] = A[i];
}
return n - count;

(使用了额外的空间，本题不适用)将数组元素放入map中，然后输出map的大小。

2016-08-11 14:33:57

## [LeetCode] 26. Remove Duplicates from Sorted Array ☆(从有序数组中删除重复项)

[LeetCode] Remove Duplicates from Sorted Array 有序数组中去除重复项 描述 Given a sorted array nums, 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

## leetCode 26.Remove Duplicates from Sorted Array(删除数组重复点) 解题思路和方法

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.

## LeetCode 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

## Leetcode 26. Remove Duplicates from Sorted Array C语言

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

## LeetCode 26 Remove Duplicates from Sorted Array (C,C++,Java,Python)

Problem: 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 a

## Leetcode 26. Remove Duplicates from Sorted Array (easy)

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 by modifying the input array in-place with O(1) extra memory. Exam