题目:https://oj.leetcode.com/problems/remove-duplicates-from-sorted-array/
题意:求一组数中,有多少个不同的,注意!不仅要返回个数,还要把原来的数组变成没重复的。。也真伤,我也是没看懂题
class Solution {
public:
int removeDuplicates(int A[], int n) {
int count = n;
int j=0;
for(int i =1;i<n;i++){
if(A[j]< A[i]) A[++j] = A[i];
else count --;
}
return count;
}
};
题目:https://oj.leetcode.com/problems/remove-element/
题意:和上一道题差不多,去掉数组中=element的数,返回去掉后数组的长度,并将数组改成没有带element的数组
class Solution {
public:
int removeElement(int A[], int n, int elem) {
sort(A,A+n);
int count =n;
int j=0;
for(int i =0;i<n;i++){
if(A[i]!=elem)A[j++]=A[i] ;
else count--;
}
return count;
}
};