首页 > 代码库 > LeetCode Remove Duplicates from Sorted Array II
LeetCode Remove Duplicates from Sorted Array II
title
描写叙述
Follow up for ”Remove Duplicates”: What if duplicates are allowed at most twice?
描写叙述
Follow up for ”Remove Duplicates”: What if duplicates are allowed at most twice?
For example, Given sorted array A = [1,1,1,2,2,3],
Your function should return length = 5, and A is now [1,1,2,2,3]
#include <iostream> using namespace::std; int removeDuplicates(int *A, int length){ if(length<=2) return length; int n=2; for(int i=2; i < length; i++){ // 推断仅仅要有一个不相等 那么就不符合三连等的情况 if(A[n-2]!=A[n-1] || A[n-2]!=A[i]){ A[n++] = A[i]; } } return n; } int main(int argc, const char * argv[]) { // insert code here... std::cout << "Hello, World!\n"; int n = 17+1; int A[]={1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,3,3}; int resu = removeDuplicates(A, n); for(int i=0; i < resu; i++) cout << A[i] << " "; return 0; }
LeetCode Remove Duplicates from Sorted Array II
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。