LeetCode: Remove Duplicates from Sorted Array
来源:互联网 发布:大芒果魔兽数据库 编辑:程序博客网 时间:2024/06/03 13:25
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.
题目解析:用一个变量currid记录当前更新的位置,每次遇到不重复的元素,加1
int removeDuplicates(int* nums, int numsSize) { if (numsSize <= 0) return numsSize; int currid = 1; for (int i = 1; i < numsSize; ++i) { while(nums[i] == nums[currid - 1] && i < numsSize) {i++;} if (i < numsSize) { nums[currid] = nums[i]; currid++; } } return currid; }
1 0
- [leetcode][array] Remove Duplicates from Sorted Array
- 【Leetcode】【Array】Remove Duplicates from Sorted Array
- LeetCode: Remove Duplicates from Sorted Array
- 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 Array
- LeetCode: Remove Duplicates from Sorted Array II
- [Leetcode] Remove Duplicates from Sorted Array II
- leetcode 35: Remove Duplicates from Sorted Array
- [LeetCode] Remove Duplicates from Sorted Array II
- [LeetCode] Remove Duplicates from Sorted Array
- Leetcode: Remove Duplicates from Sorted Array
- [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 Array
- [leetcode]Remove Duplicates from Sorted Array II
- RSA整理--频谱路由分配算法
- angularJs
- Linux安装一些软件的命令
- Scala单例对象、伴生对象实战详解
- 2. Add Two Numbers解题思路
- LeetCode: Remove Duplicates from Sorted Array
- 使用maven创建web项目
- ARM微处理器中支持字节、半字、字三种数据类型,地址的低两位为0是啥意思?
- php unicode转中文
- styleable cannot be resolved or is not a field
- 设计模式 之 Singleton(Java实现)
- 图像医学处理概论(2)
- Codeforces Round #369 (Div. 2) D. Directed Roads 图论、组合学、二重dfs、并查集形式的图、Interesting、好题
- Android适配底部返回键等虚拟键盘的完美解决方案