26. Remove Duplicates from Sorted Array
来源:互联网 发布:倒班表软件 编辑:程序博客网 时间:2024/06/03 17:44
一,题目
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.
public int removeDuplicates(int[] nums) {int num = 0;if(nums == null || nums.length == 0){return num;}num =1;int pre = nums[0];for(int i=1,len=nums.length; i<len; i++){if(nums[i] != pre){pre = nums[i];nums[num++] = nums[i];}}return num;}
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
- Android开发笔记之音乐播放器
- java缓存ehcache和memcache区别
- STL之list容器详解
- java compiler level does not match解决方法
- 剑指offer27--查找数组中最小的k个数
- 26. Remove Duplicates from Sorted Array
- UML系列图--用例图
- Azkaban Getting Started
- 我的JavaEE学习路线图
- 如何区分已存在的变量a是对象还是数组?
- 飛飛(六十七)文件的应用 数数
- Android入门-SayHello实现页面跳转
- android中的消息机制--浅谈Handler的原理及使用
- Leetcode 87. Scramble String