package LeetCode;
public class Test {
public static void main(String[] args) {
int[] nums1 = {3,2,2,3};
for (int i = 0; i < nums1.length; i++) {
System.out.print(nums1[i] + "\t");
}
System.out.println();
System.out.println(removeElement(nums1, 3));
int[] nums2 = {0,1,2,2,3,0,4,2};
for (int i = 0; i < nums2.length; i++) {
System.out.print(nums2[i] + "\t");
}
System.out.println();
System.out.println(removeElement(nums2, 2));
}
public static int removeElement(int[] nums, int val) {
int length = nums.length;
int i = 0, j = 0;
while (i < length) {
if (nums[i] != val) {
nums[j] = nums[i];
j++;
i++;
} else {
//去重
i++;
}
}
if (j == 0) {
return 0;
} else {
for (int k = 0; k < j; k++) {
System.out.print(nums[k] + "\t");
}
System.out.println();
return j;
}
}
}