Remove Duplicates from sorted array
来源:互联网 发布:淘宝直通车开通怎么用 编辑:程序博客网 时间:2024/06/05 08:41
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.
解法:
参照Remove Element的解法,很容易得到:
int removeDuplicates(vector<int>& nums) { if (nums.size() == 0){ return 0; } int size = 0, length = nums.size(); for (int i = 1; i < length; ){ if (nums[size] == nums[i]) i++; else{ nums[++size] = nums[i++]; } } return size+1;}
0 0
- Remove Duplicates from Sorted Array
- Remove Duplicates from Sorted Array
- Remove Duplicates from Sorted Array
- Remove Duplicates from Sorted Array
- Remove Duplicates from Sorted Array
- Remove Duplicates from Sorted Array
- Remove Duplicates From Sorted Array
- Remove Duplicates from Sorted Array
- Remove Duplicates from Sorted Array
- Remove Duplicates from Sorted Array
- Remove Duplicates from Sorted Array
- Remove Duplicates from Sorted Array
- Remove Duplicates from Sorted Array
- Remove Duplicates from Sorted Array
- Remove Duplicates from Sorted Array
- Remove Duplicates from Sorted Array
- Remove Duplicates from Sorted Array
- Remove Duplicates from Sorted Array
- iOS9 HTTP访问不了的解决方法
- HDU-2159(FATE)
- 20151026-linux目录操作
- Linux-CentOS XAMPP Apache配置多端口
- UVALive 6462 状压DP
- Remove Duplicates from sorted array
- 旋转数组中的最小数字
- oracle dba 使用mysql 时的痛点--待吐槽
- C语言中的常量
- Linux进程间通信总结
- 论学习的目的
- VS2015--win32工程配置的一些想法之VS2015编译的程序在其他机器上缺少msvcp120.dll
- HDU 4777 思维 + 树状数组
- 对称矩阵的压缩存储及基本运算(2)