[Leetcode] Remove duplicates from Sorted Array II (Java implementation) __java

New Ket Network test address: https://www.nowcoder.com/questionTerminal/567f420f12ed4069b7e1d1520719d409

Leetcode Address: Https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/#/description

Topic:

Remove duplicates from Sorted Array II

Follow up for "Remove duplicates":
What if duplicates are allowed at most twice?

For example,
Given sorted array nums = [1,1,1,2,2,3],

Your function should return length = 5, with the five elements of nums being 1, 1, 2, 2 and 3. It doesn ' t matter what you leave beyond the new length.

Subscribe to the which companies asked this question.

Package go.jacob.day523;

public class Demo1 {public
	int removeduplicates (int[] nums) {
		//Exception Input
		if (nums = null | | nums.length <= 1 ) return
			Nums = = null 0:nums.length;
		int count = 2;
		for (int i = 2; i < nums.length i++) {
			//NOTE: Here The criterion cannot be nums[i]!= nums[i-2]
			if (nums[i)!= nums[count-2]) 
  nums[count++] = Nums[i];
		}
		return count;
	}
}