Minimum Deletions to Make Array Beautiful LeetCode solution in Java

1
class Solution {
2
  public int minDeletion(int[] nums) {
3

4
    int deletion = 0, n = nums.length;
5

6
    for (int i = 0; i < n - 1; ) {
7
      int newIndex = i - deletion;
8
      if ((newIndex % 2 == 0) && nums[i] == nums[i + 1]) deletion++;
9
      else i++;
10
    }
11
    return ((n - deletion) % 2 == 0) ? deletion : deletion + 1;
12
  }
13
}