Help With JAVA Please

Each of the functions below is meant to be SELF CONTAINED. This means that * you should use no other functions or classes unless otherwise indicated. * You should not use any HashSets or ArrayLists, or anything else! * In addition, each of your functions should go * through the argument array at most once. The only exception to this * deDupAndReverse, which is allowed to call numUnique and then go through the * array once after that. */ public class CSC300Program3a {

/** * numUnique returns the number of unique values in an array of ints. * Precondition: the array may be empty, but if it is not empty the array is sorted from low to high. * { your solution can assume this is true } * * Your solution must go through the array exactly once. Your solution must * not call any other functions. Here are some examples (using "==" informally): * *

 * 0 == numUnique(new int[] { }) * 1 == numUnique(new int[] { 11 }) * 1 == numUnique(new int[] { 11, 11, 11, 11 }) * 8 == numUnique(new int[] { 11, 11, 11, 11, 22, 33, 44, 44, 44, 44, 44, 55, 55, 66, 77, 88, 88 }) * 8 == numUnique(new int[] { 11, 22, 33, 44, 44, 44, 44, 44, 55, 55, 66, 77, 88 }) * 

*/ public static int numUnique (int[] list) { return -1; //TODO1: fix this }

Thank you!