首页 > 代码库 > leetcode 26 Remove Duplicates from Sorted Array
leetcode 26 Remove Duplicates from Sorted Array
Remove Duplicates from Sorted ArrayTotal Accepted: 66627 Total Submissions: 212739 My Submissions
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;
}
};
一行代码的STL:
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
??
leetcode 26 Remove Duplicates from Sorted Array
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。