Short method that takes in an integer array and moves all the zeroes to the right-most indices.

ZeroesToTheRight.java

public static void zeroRightShift(int[] A) {
		if(A == null) return;
		
		int zeroPtr = A.length - 1;
		
		while(zeroPtr >= 0) {
			if(A[zeroPtr] != 0) break;
			zeroPtr--;
		}
		
		int findPtr = zeroPtr - 1;
		
		while(findPtr >= 0) {
			if(A[findPtr] == 0) {
				A[findPtr] = A[zeroPtr]; //Put nonzero value at index we found zero in
				A[zeroPtr] = 0;
				zeroPtr--;
			}
			findPtr--;
		}
	}