26. Remove Duplicates from Sorted Array
来源：互联网 发布：java shell 编辑：程序博客网 时间：2024/05/17 01:22
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.
由于输入的数组是有序的，因此处理起来就非常的简单。如下：
class Solution { public int removeDuplicates(int[] nums) { int index = 0, len = nums.length; if (len == 0){ return 0; } nums[index++] = nums[0]; for (int i = 1; i < len; ++ i){ if (nums[i] != nums[i-1]) nums[index++] = nums[i]; } return index; }}阅读全文
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
- HDU4426-Palindromic Substring
- 解决linux上启动redis后配置文件未生效的问题
- Kettle入门——Kettle基本概念
- Java面试（转）
- 打印当前时间。学习使用Date类和Calendar类。（教材P194页）
- 26. Remove Duplicates from Sorted Array
- 计算机视觉
- 算法设计-倒推法
- 剑指offer_数组---构建乘积数组
- IDE 10 月指数榜：Eclipse 反超 Visual Studio
- linux文件与目录的默认权限和隐藏权限。
- 将Java程序打包成jar并执行
- 第五单元笔记整理
- Kettle进阶——Kitchen源码阅读
