LeetCode ||Remove Duplicates from Sorted Array II
来源:互联网 发布:淘宝达人如何合作 编辑:程序博客网 时间:2024/06/11 10:32
方法一:耗时20ms
class Solution {public: int removeDuplicates(vector<int>& nums) { if(nums.size() <= 2) return nums.size(); int i = 1; int pre = nums[0]; int preCount = 1; while(i < nums.size()) { if(pre == nums[i]) { preCount++; if(preCount > 2)//每次出现次数大于2就erase. { //需要删除nums[i] nums.erase(nums.begin()+i); continue; } } else { preCount = 1; pre = nums[i]; } i++; } return nums.size(); }};
方法二:耗时20ms
class Solution {public: int removeDuplicates(vector<int>& nums) { if(nums.size() <= 2) return nums.size(); int i = 1; int pre = nums[0]; int preCount = 1; int small = 1;//small表示移动数组后,指针应该指向的位置。 while(i < nums.size()) { if(pre == nums[i]) { preCount++; if(small != i)//需要移动i到small 位置上。 { nums[small] = nums[i]; } if(preCount > 2) { small--; } } else { preCount = 1; pre = nums[i]; if(small!=i) nums[small] = nums[i]; } i++; small++; } while(small < nums.size())//将后面重复的数字删除。 { nums.pop_back(); } return nums.size(); }};
0 0
- 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
- Leetcode Remove Duplicates from Sorted Array II
- 可能是ThinkPHP导航高亮显示当前页面的最简便的方法
- ZOJ 3867 Earthstone: Easy Version
- 工作到底都能给你带来哪些好处?
- Django学习笔记第2记
- POJ 2912 Rochambeau(枚举 + 偏移量并查集)
- LeetCode ||Remove Duplicates from Sorted Array II
- Android - Looper / Handler / Message
- Sublime Text指南
- 临睡前的十分钟,决定未来职场的高度
- Java虚拟机(1)自动内存管理机制
- ios启动页面自定义设置方法
- 中庸之道
- 追踪电子表格中的单元格(uva-512)
- Django学习笔记第3记