Remove Duplicates from Sorted Array II

最新推荐文章于 2024-10-15 16:25:28 发布
最新推荐文章于 2024-10-15 16:25:28 发布
阅读量203 收藏
点赞数
分类专栏： LeetCode 文章标签： LeetCode c语言
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/IMISSHOT/article/details/78170469
版权 
/*
2017.10.7
//LeedCode : Remove Duplicates from Sorted Array II 
需要一个计数器,如果重复次数小于2，就把这个元素放到新数组里.
*/
int removeDuplicates(int* nums, int numsSize) {
    
    int k = 0, i, cnt = 1;;
    if(numsSize == 0)
        return numsSize;
    
    for(i = 1; i < numsSize; i++){
        if(nums[k] == nums[i]){
            cnt++;
            if(cnt == 2)
                nums[++k] = nums[i];
            
        }else{
            cnt = 1;
            nums[++k] = nums[i];
        }
    }
    
    return k+1;
}
原题链接
IMISSHOT
关注
专栏目录
leetcode 80. Remove Duplicates from Sorted Array II
zwzcdcll的博客
07-28 213
#include<iostream> #include<vector> using namespace std; class Solution { public: int removeDuplicates(vector<int>& nums) { if(nums.empty()){ return 0; } int index...
80. Remove Duplicates from Sorted Array II
小菜鸟的博客
05-24 357
80. Remove Duplicates from Sorted Array IIclass Solution { public: int removeDuplicates(vector&lt;int&gt;&amp; nums) { if(nums.size()&lt;3) return nums.size(); int firs...
LeetCode_Array_80. Remove Duplicates from Sorted Array II (C++)
&再见萤火虫&的博客
02-05 227
目录 1，题目描述 2，思路 3，代码 4，测试效果 1，题目描述 Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length. Do not allocate extra space fo...
LeetCode80. Remove Duplicates from Sorted Array II（C++）
qq_41562704的博客
01-27 341
Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length. Do not allocate extra space for another array, you must do this by mod...
LeetCode 80 Remove Duplicates from Sorted Array II [Array/auto] <c++>
weixin_30338497的博客
01-22 149
LeetCode 80 Remove Duplicates from Sorted Array II [Array/auto] <c++> 给出排序好的一维数组，如果一个元素重复出现的次数大于两次，删除多余的复制，返回删除后数组长度，要求不另开内存空间。 C++ 献上自己丑陋无比的代码。相当于自己实现一个带计数器的unique函数 class Solution { public: ...
数组（2）：Remove Duplicates from Sorted Array II
谁心里还没有个梦呢？
04-01 263
描述： 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...
LeetCode 80. Remove Duplicates from Sorted Array II（有序数组移除重复数字Ⅱ）
andersonxie的博客
03-26 235
题目描述：    Follow up for "Remove Duplicates": what if duplicates are allowed at most twice?    For example, given sorted array nums = [1,1,1,2,2,3].    Your function should return length = 5, with the f...
leetcode80. Remove Duplicates from Sorted Array II
中华小当家的博客
02-08 175
题目描述 Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length. Do not allocate extra space for another array, you must do this by...
LeetCode80：Remove Duplicates from Sorted Array II
卷卷萌的博客
11-28 180
Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length. Do not allocate extra space for another array, you must do this by mod...
LeetCode Remove Duplicates from Sorted Array解决方案
01-23
int removeDuplicates(vector<int>& nums) { vector<int>::iterator iter = nums.begin(); while (nums.begin() != nums.end()) { vector<int>::iterator temp = iter; vector<int>::iterator temp2 = ++iter; ...
26.Remove Duplicates from Sorted Array删除有序数组中的重复项【LeetCode单题讲解系列】
08-31
26.Remove_Duplicates_from_Sorted_Array删除有序数组中的重复项【LeetCode单题讲解系列
Leetcode 80. Remove Duplicates from Sorted Array II -- 删除有序数组中重复元素，重复元素最多出现2次
Top5软件工程硕士，先后在京东、字节从事多年Java后端开发、实时和离线大数据开发
06-30 570
Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length. Do not allocate extra space for another array, you must do this by mod...
26. Remove Duplicates from Sorted Array
qq_21963133的博客
05-16 341
题目：26. Remove Duplicates from Sorted Array 从有序数组中移除重复元素 难度：简单 Given a sorted arraynums, remove the duplicatesin-placesuch that each element appear onlyonceand return the new length. Do not all...
【C语言】数据的输入格式
我的我的博客
10-15 255
注意★★★：char类型在读取数据时，数据的分隔符也会直接读取，比如换行或者空格，也会直接存储。
【C语言】Hello world!
我的我的博客
10-15 384
第二行：main函数，C语言源程序的入口，也是读代码的开端。函数从stdio.h头文件中进行调用，已经实现，直接调用。printf函数引号包含什么内容，即可打印至电脑屏幕。C语言入门，hello C language.C语言源程序入门，hello world!输出hello world。第一行：预处理阶段进行处理。
rhino grasshoper 框内物体排列（附视频）.gh
最新发布
10-18
【闭合线内物体按方向移动/排列】https://www.bilibili.com/video/BV1z1WfeSEWu?vd_source=b420114c993138474d2e93d83ead77a5
kwant-1.4.3-cp38-cp38-win_amd64.whl
10-18
kwant-1.4.3-cp38-cp38-win_amd64.whl
rhino grasshoper 景观椅（附视频）.gh
10-18
【rhino@grasshoper 曲线金属座椅景观案例（文件获取/见简介）】https://www.bilibili.com/video/BV1Dx4y147Lr?vd_source=b420114c993138474d2e93d83ead77a5
Write a function RemoveDuplicates (array, n) that removes all duplicatevalues from a sorted array of integers, leaving only a single copy of each value.RemoveDuplicates should return the effective size of the new array.
06-06
Sure, here's a possible implementation of the RemoveDuplicates function in C++: ``` int RemoveDuplicates(int array[], int n) { if (n == 0) { return 0; } int j = 0; for (int i = 1; i < n; i++) { if (array[i] != array[j]) { j++; array[j] = array[i]; } } return j + 1; } ``` The function takes as input an array of integers `array` and its size `n`. It assumes that the array is sorted in non-decreasing order, so that duplicates are adjacent. The function then uses two pointers `i` and `j` to scan the array, keeping only the first occurrence of each value. The variable `j` keeps track of the last non-duplicate value found, and is used to overwrite the duplicates with new values. Finally, the function returns the size of the new array, which is `j+1`, since `j` is the index of the last non-duplicate value. Here's an example of how to use the function: ``` int main() { int array[] = {1, 2, 2, 3, 3, 3, 4, 5, 5, 5, 5, 6}; int n = sizeof(array) / sizeof(array[0]); int new_size = RemoveDuplicates(array, n); for (int i = 0; i < new_size; i++) { std::cout << array[i] << " "; } std::cout << std::endl; return 0; } ``` This should output: ``` 1 2 3 4 5 6 ```
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值