leetcode 080 Remove Duplicates from Sorted Array II(难易度:Medium)
来源:互联网 发布:java 写html文件 编辑:程序博客网 时间:2024/06/07 21:44
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 ofnums being1
, 1
, 2
, 2
and3
. It doesn't matter what you leave beyond the new length.
int removeDuplicates(int* nums, int numsSize) { if (numsSize <= 2)return numsSize;int index = 2;for (int i = 2; i < numsSize; i++) {if (nums[i] != nums[index - 2])nums[index++] = nums[i];}return index;}原题地址:https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/
0 0
- leetcode 080 Remove Duplicates from Sorted Array II(难易度:Medium)
- [leetcode 80, Medium] Remove Duplicates from Sorted Array II
- LeetCode-80-Remove Duplicates from Sorted Array II(递归)-Medium
- Leetcode 80. Remove Duplicates from Sorted Array II (Medium) (cpp)
- leetcode 026 Remove Duplicates from Sorted Array(难易度:Easy)
- LeetCode刷题(C++)——Remove Duplicates from Sorted Array II(Medium)
- 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
- jqery实现10X10的表格,双击消失
- 停课的沉淀反思(四)——任道重远
- poj 1222
- 自定义的RPC的Java实现
- Bios工程师手边事—battery
- leetcode 080 Remove Duplicates from Sorted Array II(难易度:Medium)
- 查找(二)二叉查找数BST
- PAT(甲级)1049
- android读入一个txt文件
- 读写文件的工具类IOUtils 和FileUtils
- PAT(甲级)1050
- javascript闪烁图片
- 关于mysql中文插入 问号??问题的解决方法!
- HDU - 1176 免费馅饼(DP)