LeetCode 80 Remove Duplicates from Sorted Array II
来源:互联网 发布:剑三小令狐伤捏脸数据 编辑:程序博客网 时间:2024/06/07 12:06
LeetCode
80 Remove Duplicates from Sorted Array II
题目
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 first five elements of nums being 1
, 1
, 2
, 2
and 3
. It doesn’t matter what you leave beyond the new length.
解答
class Solution {public: int removeDuplicates(vector<int>& nums) { const int n = nums.size(); if (n <= 2) return n; int tail = 2; for (int i = 2; i < n; i++) { if (nums[i] != nums[tail - 2]) nums[tail++] = nums[i]; } return tail; }};
0 0
- LeetCode-Array-80 Remove Duplicates from Sorted Array II
- LeetCode: Remove Duplicates from Sorted Array II
- [Leetcode] Remove Duplicates from Sorted Array II
- LeetCode: Remove Duplicates from Sorted Array II
- [Leetcode] Remove Duplicates from Sorted Array II
- [LeetCode] Remove Duplicates from Sorted Array II
- [leetcode] Remove Duplicates from Sorted Array II
- [LeetCode]Remove Duplicates from Sorted Array II
- [leetcode]Remove Duplicates from Sorted Array II
- LeetCode-Remove Duplicates from Sorted Array II
- [leetcode] Remove Duplicates from Sorted Array II
- LeetCode - Remove Duplicates from Sorted Array II
- LeetCode:Remove Duplicates from Sorted Array II
- LeetCode | Remove Duplicates from Sorted Array II
- Leetcode: Remove Duplicates from Sorted Array II
- 【leetcode】Remove Duplicates from Sorted Array II
- Leetcode: Remove Duplicates from Sorted Array II
- [LeetCode] Remove Duplicates from Sorted Array II
- LVS学习笔记 2安装ipvsadm和LVS-NAT实验
- Struts2 返回纯字符串
- vc++ Tree Control使用总结
- CAS实现单点登录(SSO)经典完整教程
- 分页控件中的数字按钮计算方法
- LeetCode 80 Remove Duplicates from Sorted Array II
- 第9周项目2-Time类中的运算符重载(续)
- 黑马程序员IOS-OC语言-类的本质、SEL
- ZOJ3299:Fall the Brick(区间更新)
- Stencil buffer is not enabled.的问题解决
- Mac电脑管理Android手机(传输文件)
- Android onTouchEvent事件
- Binary Tree Level Order Traversal II -- leetcode
- PHP---常用代码