Array Programming Complete the class code and write a static method named isUniq
ID: 3703072 • Letter: A
Question
Array Programming
Complete the class code and write a static method named isUnique that takes an array of integers as a parameter and that returns a boolean value indicating whether or not the values in the array are unique (true for yes, false for no). The values in the list are considered unique if there is no pair of values that are equal. For example, if a variable called list stores the following values:
int[] list = {3, 8, 12, 2, 9, 17, 43, -8, 46, 203, 14, 97, 10, 4};
Then the call of isUnique(list) should return true because there are no duplicated values in this list.
If instead the list stored these values:
int[] list = {4, 7, 2, 3, 9, 12, -47, -19, 308, 3, 74};
Then the call should return false because the value 3 appears twice in this list. Notice that given this definition, a list of 0 or 1 elements would be considered unique.
public class IsUnique {
public static void main(String[] args) {
int[] list1 = {3, 8, 12, 2, 9, 17, 43, -8, 46, 203, 14, 97, 10, 4};
int[] list2 = {4, 7, 2, 3, 9, 12, -47, -19, 308, 3, 74};
System.out.println("List1 " + (isUnique(list1)? "is":"is not") + " unique");
System.out.println("List2 " + (isUnique(list2)? "is":"is not") + " unique");
}
// your code here
} // end of IsUnique class
Explanation / Answer
IsUnique.java
public class IsUnique {
public static void main(String[] args) {
int[] list1 = {3, 8, 12, 2, 9, 17, 43, -8, 46, 203, 14, 97, 10, 4};
int[] list2 = {4, 7, 2, 3, 9, 12, -47, -19, 308, 3, 74};
System.out.println("List1 " + (isUnique(list1)? "is":"is not") + " unique");
System.out.println("List2 " + (isUnique(list2)? "is":"is not") + " unique");
}
public static boolean isUnique(int a[]) {
for(int i=0;i<a.length;i++) {
for(int j=i+1;j<a.length;j++) {
if(a[i]==a[j]) {
return false;
}
}
}
return true;
}
}
Output:
List1 is unique
List2 is not unique
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.