首页 > 代码库 > leetcode : remove duplicates from sorted array [基本功]
leetcode : remove duplicates from sorted array [基本功]
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.
tag : two pinters
public class Solution { public int removeDuplicates(int[] nums) { if(nums == null || nums.length == 0){ return 0; } int len = nums.length; int count = 1; for(int i = 1; i< len; i++){ if(nums[i - 1] == nums[i]){ continue; }else{ nums[count++] = nums[i]; //count++; } } return count; } }
leetcode : remove duplicates from sorted array [基本功]
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。