标签：this ret tor leave ica etc 题目 other rom
题目:
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.
题解：
感觉这个题是真没什么好解析的。。。
Solution 1()
class Solution { public: int removeDuplicates(vector<int>& nums) { int n = nums.size(); if(n == 1 || n == 0) return n; int i = 0; for(int j=1; j<n; ) { if(nums[j] == nums[i]) { j++; continue; } nums[++i] = nums[j++]; } return i+1; } };
Solution 2()
class Solution { public: int removeDuplicates(vector<int>& nums) { int n = 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; } };
【LeetCode】026. Remove Duplicates from Sorted Array
标签：this ret tor leave ica etc 题目 other rom
原文地址：http://www.cnblogs.com/Atanisi/p/6752217.html
