BruteForce Java Solution ✅✅✅
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
### ******Intuition******
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int[] applyOperations(int[] nums) {
        for (int i=0;i<nums.length;i++)
        {
            if(i<nums.length -1 && nums[i]==nums[i+1])
            {
                nums[i]=nums[i]*2;
                nums[i+1]=0;
            }
        }
        int index = 0;
        for(int i = 0;i<nums.length;i++)
        {
            if(nums[i]!=0){
                nums[index++]=nums[i];
            }
        }
        while(index<nums.length){
            nums[index++]=0;
        }
        return nums;
    }
}
```
['Java']