leetcode - remove duplicates
来源:互联网 发布:人文社会科学类软件 编辑:程序博客网 时间:2024/06/06 07:52
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]
.
#include <iostream>using namespace std;#define NUM4class Solution {public:int removeDuplicates(int A[], int n) {int len = 0;for (int i = 0; i<(n); i++){while (A[i] == A[i + 1]){i++;}A[len++] = A[i];}return len;}};void main(){int a[NUM] = { 1, 1, 2, 2 };Solution slt;slt.removeDuplicates(a, NUM);}
0 0
- leetcode - remove duplicates
- [Leetcode]Remove duplicates
- leetcode 26 Remove Duplicates
- LeetCode: Remove Duplicates from Sorted List
- LeetCode: Remove Duplicates from Sorted Array
- LeetCode: Remove Duplicates from Sorted List II
- LeetCode: Remove Duplicates from Sorted Array II
- [Leetcode] Remove Duplicates from Sorted Array
- [Leetcode] Remove Duplicates from Sorted Array II
- [Leetcode] Remove Duplicates from Sorted List
- [Leetcode] Remove Duplicates from Sorted List II
- LeetCode: Remove Duplicates from Sorted Array
- LeetCode: Remove Duplicates from Sorted Array II
- LeetCode: Remove Duplicates from Sorted List
- LeetCode: Remove Duplicates from Sorted List II
- [Leetcode] Remove Duplicates from Sorted List II
- [Leetcode] Remove Duplicates from Sorted Array II
- leetcode 35: Remove Duplicates from Sorted Array
- Linux socket编程(三) 简单的多线程聊天室
- sqrt(x)
- 深入探索3D拾取技术
- Linux socket编程(四) 简单聊天室之epoll版
- Linux socket编程(五) 文件传输
- leetcode - remove duplicates
- VmWare下安装CentOS6图文安装教程
- OC-NSArray
- 十进制转换二进制
- JVM 内部运行线程介绍
- memcpy的用法 总结
- Linux 编程 共享内存
- EXTJS中使用遮罩效果LoadMask
- memcmp与strcmp函数