Java for Leetcode 080 Remove duplicates from Sorted Array II

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

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

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

Problem Solving Ideas:

There are many ways to do this, and here is another way to open an array, Java implementation is as follows:

    public int removeduplicates (int[] nums) {if (Nums.length <= 2) return nums.length;int[] numscopy = new Int[nums.length]; Numscopy[0] = nums[0];numscopy[1] = Nums[1];int index = 2;for (int i = 2; i < nums.length; i++) if (nums[i]! = numscopy [Index-2]) {Numscopy[index] = nums[i];index++;} for (int i = 0; i < index; i++) nums[i] = Numscopy[i];return index;    }

Java for Leetcode 080 Remove duplicates from Sorted Array II