Question

I need help with this Java exercise. I'm not allowed to use imports and I tried coding it but ended up failing.

        /**
                Given a String array, return an String array with duplicate Strings removed if the array contains duplicate values. <br>
                Note: Capital letters count. <br> <br>

                removeDuplicateStrings({"a"}) -> {"a"} <br>
                removeDuplicateStrings({"a", "b", "c", "d"}) -> {"a", "b", "c", "d"} <br>
                removeDuplicateStrings({"a", "a"})  -> {"a"} <br>
                removeDuplicateStrings({"A", "a"})  -> {"A", "a"} <br>
                removeDuplicateStrings({"these", "are", "the", "times"}) -> {"these", "are", "the", "times"} <br>
                removeDuplicateStrings({"these", "times", "are", "the", "times", "they", "are"}) -> {"these", "times", "are", "the", "they"} <br>
                @param strings String[] an array of integers.
                @return String[] An array with the duplicates removed.
        **/
        public static String[] removeDuplicateStrings(String[] strings) {
                //your code here
                        return strings;
                }//end removeDuplicateStrings

Answer 1

public class RenoveStringDup {
   public static void main(String[] args) {
       String arr1[]={"these", "times", "are", "the", "times", "they", "are"};
       printArray(arr1);
       printArray(removeDuplicateStrings(arr1));
   }

   private static void printArray(String[] arr) {
       for(String s:arr)
           System.out.print(s+" ");
       System.out.println();
   }

   public static String[] removeDuplicateStrings(String[] strings) {
       int count=0;
       for (int s = 0; s < strings.length - 1; s++) {
           for (int m = s + 1; m < strings.length; m++) {

               if (strings[s] != null && strings[s].equals(strings[m])) {
                   // array = ArrayUtils.removeElement(array, array[s]); --m;??
                   strings[m] = null; // Mark for deletion later on
                   count++;
               }
           }
       }
       String res[]=new String[strings.length-count];
       for (int s = 0,i=0; s < strings.length - 1; s++) {
           if(strings[s]!=null)
               res[i++]=strings[s];
       }
       return res;
   }// end remove
}

E Console 3 temid> RenoveStringDup [Java Application] C:1Soft Peaein64-4.5.2.2Peg these times are the times they are these times are the thev