[LeetCode] Array - Replace Elements with Greatest Element on Right Side

class Solution {
    public int[] replaceElements(int[] arr) {
        int rightMax = 0;		
		
		for (int i = 0; i < arr.length - 1; i++) {
			
			for (int j = i+1; j < arr.length; j++) {
				if(rightMax < arr[j])
					rightMax = arr[j];				
			}			
			arr[i] = rightMax;
			rightMax = 0;											
		}		
		arr[arr.length - 1] = -1;
				
		return arr;
    }
}