Question

Implement the function hasDuplicates. Input will be given as a line containing a positive integer n, followed by n rows, each containing a string. The output should be either the word true if there are any duplicates among these strings or false if there are not.

Your code should work well on long lists of strings.

Use the following set-up to write the code in JAVA

import java.lang.UnsupportedOperationException;
import java.util.Scanner;

public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
  
// parse the number of strings
int numStrings = Integer.parseInt(sc.nextLine());
  
// parse each string
String[] stringsArray = new String[numStrings];
for (int i = 0; i < numStrings; i++) {
stringsArray[i] = sc.nextLine();
}
  
// print whether there are duplicates
System.out.println(hasDuplicates(stringsArray));
}
  
private static boolean hasDuplicates(String[] stringsArray) {
// TODO fill this in and remove the below line
throw new UnsupportedOperationException();
}
}

ONLY USE THIS FOLLOWING SET UP ON THE TOP TO WRITE THE CIDE IN JAVA...

(show an example for the input and out of the code when finished as well)

Answer 1

import java.lang.UnsupportedOperationException;
import java.util.Scanner;

public class HasDuplicates {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

// parse the number of strings
        int numStrings = Integer.parseInt(sc.nextLine());

// parse each string
        String[] stringsArray = new String[numStrings];
        for (int i = 0; i < numStrings; i++) {
            stringsArray[i] = sc.nextLine();
        }

// print whether there are duplicates
        System.out.println(hasDuplicates(stringsArray));
    }

    private static boolean hasDuplicates(String[] stringsArray) {
        try {
            int numWords = stringsArray.length;
            for (int i = 0; i < numWords; i++) {
                for (int j = i + 1; j < numWords; j++) {
                    if (stringsArray[i].equals(stringsArray[j])) {
                        return true;
                    }
                }
            }
            return false;
        }
        catch (Exception e){
            throw new UnsupportedOperationException();
        }
    }
}