# leetcode 26 Remove Duplicates from Sorted Array

Remove Duplicates from Sorted ArrayTotal Accepted: 66627 Total Submissions: 212739

Given a sorted array, remove the duplicates in place such that each element appear onlyonce 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 ofnums being 1 and 2 respectively. It doesn't matter what you leave beyond the new length

64ms好像有点慢了，这个方法有点讨巧了，绕过了算法的部分，以后还是少写这样的代码，多练习算法

class Solution {
public:
int removeDuplicates(vector<int>& nums)
{
set<int> result;
for(int i = 0;i< nums.size();i++)
{
result.insert(nums[i]);
}
nums.clear();
set<int>::iterator iter = result.begin();
for(;iter!=result.end();iter++)
{
nums.push_back(*iter);
}
return nums.size();
}
};

class Solution {
public:
int removeDuplicates(vector<int>& nums) {
int start=1,N = nums.size();
if(N<=1) return N;
for(int i=1;i<nums.size();i++) {
if(nums[i]!=nums[i-1]){
nums[start]=nums[i];
start++;
}
}
return start;
}
};


class Solution { public: int removeDuplicates(int A[], int n) { return distance(A, unique(A, A+n)); } };

int removeDuplicates(vector<int>& nums) {
if(nums.size() <= 1) return nums.size();

vector<int>::iterator it1,it2;
for(it1=nums.begin(),it2=nums.begin()+1; it2 != nums.end();) {
if(*it2 == *it1) it2=nums.erase(it2);
else {it1++;it2++;}
}

return nums.size();
}


python解决方案：

class Solution:
# @param a list of integers
# @return an integer
def removeDuplicates(self, A):
if not A:
return 0

newTail = 0

for i in range(1, len(A)):
if A[i] != A[newTail]:
newTail += 1
A[newTail] = A[i]

return newTail + 1


﻿﻿

|
10月前
Leetcode 4. Median of Two Sorted Arrays

28 0
|
10月前
Leetcode Find Minimum in Rotated Sorted Array 题解

37 0
Search in Rotated Sorted Array - 循环有序数组查找问题
Search in Rotated Sorted Array - 循环有序数组查找问题
63 0
LeetCode 167 Two Sum II - Input array is sorted（输入已排序数组，求其中两个数的和等于给定的数）

76 0
|

LeetCode contest 200 5476. 找出数组游戏的赢家 Find the Winner of an Array Game
LeetCode contest 200 5476. 找出数组游戏的赢家 Find the Winner of an Array Game
119 0
|

LeetCode 108. 将有序数组转换为二叉搜索树 Convert Sorted Array to Binary Search Tree
LeetCode 108. 将有序数组转换为二叉搜索树 Convert Sorted Array to Binary Search Tree
117 0
|
1月前
|
Python
【Leetcode刷题Python】剑指 Offer 32 - III. 从上到下打印二叉树 III

37 6
|
1月前
|
Python
【Leetcode刷题Python】剑指 Offer 26. 树的子结构

33 4
|
1月前
|

【Leetcode刷题Python】牛客. 数组中未出现的最小正整数

60 2
|
1月前
|

【Leetcode刷题Python】从列表list中创建一颗二叉树

31 7