leetcode 26. Remove Duplicates from Sorted Array 27. Remove Element

一  题目

Given a sorted array nums, 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 by modifying the input array in-place with O(1) extra memory.

Example 1:

Given 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 returned length.

Example 2:

Given nums = [0,0,1,1,1,2,2,3,3,4],

Your function should return length = 5
, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.

It doesn't matter what values are set beyond the returned length.

二 分析

    这题目是easy级别。但是依然翻车了。

给定一个有序数组，你需要原地删除其中的重复内容，使每个元素只出现一次,并返回新的长度。 
不要另外定义一个数组，您必须通过用 O(1) 额外内存原地修改输入的数组来做到这一点。

所以，额外的数组或者使用map都不行。要是移动数组性能难以满足，数组吧又不是list不方便删除，固定了长度，所以还是要采用覆盖的方式。使用指针的方式来标识。另外，要注意一点，我开始就被误导了，删重复数据，这不是目的，目的是要吧不重复的调出来，这样看起来，一道小题也真不容易。

     官网的solution

public static void main(String[] args) {
		int[] nums = {0,0,1,1,1,2,2,3,3,4};
		System.out.println("length:"+removeDuplicates(nums));
	}
	
	 public static int removeDuplicates(int[] nums) {
		 if(nums == null|| nums.length==0){
			 return 0;
		 }
		 int j=0;
		 
		 for(int i=1;i<= nums.length-1;i++){
			 if(nums[i] !=nums[j]){
				  j++;
				 nums[j] = nums[i];
			 }			  
		 }	
		 return j+1;	      
	 }

题目  27. Remove Element

Given an array nums and a value val, remove all instances of that value in-place and return the new length.

Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.

The order of elements can be changed. It doesn't matter what you leave beyond the new length.

Example 1:

Given nums = [3,2,2,3], val = 3,

Your function should return length = 2, with the first two elements of nums being 2.

It doesn't matter what you leave beyond the returned length.

Example 2:

Given nums = [0,1,2,2,3,0,4,2], val = 2,

Your function should return length = 5

, with the first five elements of nums containing 0, 1, 3, 0, and 4.
Note that the order of those five elements can be arbitrary.

It doesn't matter what values are set beyond the returned length.

分析

 跟上面题目是类似的。一个解题思路：快慢指针，快指针遍历数组，慢指针当遇到等于val移动。这样当快指针遍历完数组就结束。

public static void main(String[] args) {
		int[] nums ={0,1,2,2,3,0,4,2};
		int res= removeElement(nums,2);
		System.out.println("res="+res);
	}

    public static int removeElement(int[] nums, int val) {
        
    	int j=0;
    	for(int i=0;i<nums.length;i++){
    		if(nums[i]!= val){      		
    			nums[j]= nums[i];
    			j++;
    		}
    	}
    	return j;    		
    	
    }

Runtime: 0 ms, faster than 100.00% of Java online submissions for Remove Element.

Memory Usage: 36.1 MB, less than 100.00% of Java online submissions for Remove Element.