26. Remove Duplicates from Sorted Array
来源:互联网 发布:数据录入员笔试试题 编辑:程序博客网 时间:2024/06/13 04:15
Title
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.
Do not allocate extra space for another array, you must do this in place with constant memory.
For example,
Given input array nums = [1,1,2],
Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn’t matter what you leave beyond the new length.
Solution
class Solution {public: int removeDuplicates(vector<int>& nums) { nums.erase(unique(nums.begin(), nums.end()), nums.end()); return nums.size(); }};
runtime: 28ms
Reference
std::unique
0 0
- [LeetCode]26.Remove Duplicates from Sorted Array
- 26. Remove Duplicates from Sorted Array
- LeetCode 26. Remove Duplicates from Sorted Array
- LeetCode --- 26. Remove Duplicates from Sorted Array
- LeetCode 26.Remove Duplicates from Sorted Array
- [Leetcode] 26. Remove Duplicates from Sorted Array
- 26. Remove Duplicates from Sorted Array
- 26. Remove Duplicates from Sorted Array
- 【leetcode】26. Remove Duplicates from Sorted Array
- 【leetcode】 26. Remove Duplicates from Sorted Array
- 26. Remove Duplicates from Sorted Array
- [leetCode]26. Remove Duplicates from Sorted Array
- LeetCode 26.Remove Duplicates from Sorted Array
- 26. Remove Duplicates from Sorted Array
- 26. Remove Duplicates from Sorted Array LeetCode
- 26. Remove Duplicates from Sorted Array
- 26. Remove Duplicates from Sorted Array
- 26. Remove Duplicates from Sorted Array
- CodeUp-1036 Problem B镂空三角形
- jzoj 2553. 【NOIP2011模拟9.7】射命丸文
- 危险系数题解
- 16.8.14 C组总结
- leetcode_c++:Text Justification(068)
- 26. Remove Duplicates from Sorted Array
- 反射
- JZOJ8.14(C组)帕秋莉·诺雷姬
- 145. Binary Tree Postorder Traversal
- 错误记录三
- 获取系统日期和24小时制时间
- 批处理之命令
- POJ-2463 Bungee Jumping (简单物理题)
- jquery知识