26. Remove Duplicates from Sorted Array
来源:互联网 发布:linux 命令大全文库 编辑:程序博客网 时间:2024/06/05 05:39
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.
Subscribe to see which companies asked this question
Show Similar Problems
public class Solution { public int removeDuplicates(int[] nums) { int len = nums.length; if(len==0)return 0; int ret = 0; int c = nums[0]-1; for(int i=0;i<len;i++){ if(c!=nums[i]){ c=nums[i]; ret++; nums[ret-1]=c; } } return ret; }}
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
- Apache Kafka编程入门指南:设置分区数和复制因子
- EditText设置不自动弹出键盘
- 66. Plus One
- 云计算概念总结
- Problem B: 求各位数字之和
- 26. Remove Duplicates from Sorted Array
- 《看见》
- C++子类显示调用父类的构造函数
- swift 中通过AVFoundation来定制拍摄窗口
- model
- 118. Pascal's Triangle
- ACM程序设计选修课——1049: Efface Numbers(贪心)
- ZOJ-2050-Flip Game【状态压缩bfs】
- 【C++】知识回顾1