Remove Duplicates from Sorted Array
来源:互联网 发布:mac 隐藏文件无法显示 编辑:程序博客网 时间:2024/06/05 16:50
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 A = [1,1,2],
Your function should return length = 2, and A is now [1,2].
这个确实比较简单。。。。。
int removeDuplicates(int A[], int n){ if(A==NULL||n==0) { return 0; } int newCurrent=0; for(int i=1; i<n; i++) { if(A[newCurrent] != A[i]) { A[++newCurrent]=A[i]; } } return newCurrent+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
- 2003:等腰梯形
- hadoop和云计算的关系
- 网络编程学习之路—1
- 《Mastering Opencv ...读书笔记系列》车牌识别(I)
- 1082:寻找最低数
- Remove Duplicates from Sorted Array
- 2013-2014春运12306抢票纪实---致360、搜狗、猎豹、遨游、chrome等浏览器
- C++编程对缓冲区的理解
- hadoop入门
- Sqlite数据库操作的sql操作语句
- hadoop集群搭建——hadoop安装
- Java版 二分查找
- App_Code/DataBase.cs(数据库操作类)
- 贝塞尔曲线绘制的时钟BezierClock