LeetCode - Remove Duplicates from Sorted Array
2015-12-21 04:49
246 查看
题目:
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.
思路:
维持一个index,只要下一个数跟前一个数不相同就增加并赋值
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.
思路:
维持一个index,只要下一个数跟前一个数不相同就增加并赋值
package array; public class RemoveDuplicatesFromSortedArray { public int removeDuplicates(int[] nums) { int len = 0; if (nums == null || (len = nums.length) < 2) return len; int pos = 1; for (int i = 1; i < len; ++i) { if (nums[i] != nums[i - 1]) nums[pos++] = nums[i]; } return pos; } public static void main(String[] args) { // TODO Auto-generated method stub } }
相关文章推荐
- C标准库没提供的助手函数:字符串替换
- LeetCode - Reverse Nodes in k-Group
- Leetcode: Shortest Word Distance II
- Android RecyclerView使用详解四
- *Insertion Sort List
- python对文件及文件夹的一些操作
- 二分查找(折半查找)
- 文章标题
- 312. Burst Balloons
- 处理字符串的一些C函数
- isalpha判断字母函数的使用
- PHP(三)变量、常量
- Unity C#脚本热更
- [hdu4285 circuits] 插头dp
- Unity项目结构和版本控制
- 资源管理系统
- aopalliance.jar的用途
- LeetCode - Swap Nodes in Pairs
- poj-1979改-红与黑
- centos7-uninstall vmware