/**

* removeDuplicates returns a new array containing the unique values in the

* array. There should not be any extra space in the array --- there should

* be exactly one space for each unique element (Hint: numUnique tells you

* how big the array should be). You may assume that the list is sorted, as

* you did for numUnique.

*

* Your solution may call numUnique, but should not call any other

* functions. After the call to numUnique, you must go through the array

* exactly one more time. Here are some examples (using "==" informally):

*

*

 
 * new double[] { }
 
 * == removeDuplicates(new double[] { })
 
 * new double[] { 11 }
 
 * == removeDuplicates(new double[] { 11 })
 
 * == removeDuplicates(new double[] { 11, 11, 11, 11 })
 
 * new double[] { 11, 22, 33, 44, 55, 66, 77, 88 }
 
 * == removeDuplicates(new double[] { 11, 11, 11, 11, 22, 33, 44, 44, 44, 44, 44, 55, 55, 66, 77, 88, 88 })
 
 * == removeDuplicates(new double[] { 11, 22, 33, 44, 44, 44, 44, 44, 55, 55, 66, 77, 88 })
 
 * 

*/

public static double[] removeDuplicates (double[] list) {

return null; // TODO: fix this

}