Remove duplicates from an integer array and return the array with original order with only primitives. Complexity = O(n^2)

gistfile1.java

public static int[] removeDuplicates(int[] list) {
   int count = 0;
   for (int i = 0; i < list.length; i++) {
      boolean isExist = false;
      int value = list[i];
      list[i] = 0;
      for (int j = 0; j < count; j++) {
         if (list[j] == value) {
            isExist = true;
            break;
         }
      }
      if (!isExist) {
         list[count] = value;
         count++;
      }
   }
   return list;
}