LeetCode-数组-从排序数组中删除重复项

https://leetcode-cn.com/explore/interview/card/top-interview-questions-easy/1/array/21/

class Solution {
public static int removeDuplicates(int[] nums) {
		int[] arr = new int[nums.length];
		int x = nums.length;
		for (int i = 0; i < nums.length; i++) {
			x = x - 1;
			int y = i + 1;
			if (i == nums.length - 1) {
				arr[nums.length - 1] = nums[nums.length - 1];
			} else {
				do {
					int z = 0;
					if (nums[i] == nums[y]) {
						z = z + 1;
						break;
					}
					if (z == 0) {
						arr[i] = nums[i];
					}
					y++;
				} while (y <= x);
			}
		}
		int a = 0;
		for (int i = 0; i < arr.length; i++) {
			if (arr[i] != 0) {
				a++;
			}
		}
		int[] arrs = new int[a];
		a = 0;
		for (int i = 0; i < arr.length; i++) {
			if (arr[i] != 0) {
				arrs[a] = arr[i];
				a = a + 1;
			}
		}
		if (nums.length > 0) {
			if (nums[nums.length - 1] == 0) {
				int[] newarrs = new int[arrs.length + 1];
				newarrs[newarrs.length - 1] = 0;
				for (int i = 0; i < arrs.length; i++) {
					newarrs[i] = arrs[i];
				}
				for (int i1 = 0; i1 < newarrs.length; i1++) {
					nums[i1] = newarrs[i1];
				}
				for (int i1 : newarrs) {
					System.out.print(i1);
				}
				return newarrs.length;
			}
			for (int i2 = 0; i2 < nums.length; i2++) {
				if (nums[i2] == 0) {
					for (int i = 0; i < arrs.length; i++) {
						if (arrs[i] > 0) {
							int[] newarrs = new int[arrs.length + 1];
							newarrs[i] = 0;
							for (int a1 = 0; a1 < arrs.length + 1; a1++) {
								if (a1 > i) {
									newarrs[a1] = arrs[a1 - 1];
								}
								if (a1 < i) {
									newarrs[a1] = arrs[a1];
								}
							}
							for (int i1 = 0; i1 < newarrs.length; i1++) {
								nums[i1] = newarrs[i1];
							}
							for (int i1 : newarrs) {
								System.out.print(i1);
							}
							return newarrs.length;
						}
					}
				}
			}
			for (int i = 0; i < arrs.length; i++) {
				nums[i] = arrs[i];
			}
			for (int i : arrs) {
				System.out.print(i);
			}
			return arrs.length;

		} else {
			return 0;
		}
	}
}

已通过。