import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
public class ArrayHandler {
public static void main(String[] args) {
int[] numbers = {5, 3, 9, 1, 5, 7, 2, 1, 8, 4, 6, 1};
System.out.println("Find largest and smallest in an array:");
findLargestAndSmallest(numbers);
System.out.println("\nSearch element in an array:");
int target = 17;
System.out.println("Is " + target + " present? " + searchElement(numbers, target));
System.out.println("\nSort elements in an array:");
sortArray(numbers);
System.out.println("\nHow to find duplicates in an array or list:");
findDuplicates(numbers);
}
// Find largest and smallest in an array
public static void findLargestAndSmallest(int[] array) {
Arrays.sort(array);
int smallest = array[0];
int largest = array[array.length - 1];
System.out.println("Smallest: " + smallest);
System.out.println("Largest: " + largest);
}
// Search element in an array
public static boolean searchElement(int[] array, int target) {
for (int num : array) {
if (num == target) {
return true;
}
}
return false;
}
// Sort elements in an array
public static void sortArray(int[] array) {
Arrays.sort(array);
System.out.println("Sorted Array: " + Arrays.toString(array));
}
// How to find duplicates in an array or list
public static void findDuplicates(int[] array) {
// A Set is a collection that does not allow duplicate elements.
Set uniqueSet = new HashSet<>();
Set duplicates = new HashSet<>();
for (int num : array) {
// If the element's already present, uniqueSet.add(num) returns false, meaning that it's a duplicate.
if (!uniqueSet.add(num)) {
duplicates.add(num);
}
}
System.out.println("Duplicate elements: " + duplicates);
}
}
Want 1 to 1 personalized Java training? Email me at isingh30@gmail.com please.
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.