Untitled
unknown
plain_text
a year ago
750 B
6
Indexable
int[] findLargest_SecondLargest(int[] arr) {
int largest = Integer.MIN_VALUE;
int secondLargest = Integer.MIN_VALUE;
// Single pass through the remaining elements
for (int i = 0; i < arr.length; i++) {
if (arr[i] > largest) {
// Current element becomes largest
// Previous largest becomes second largest
secondLargest = largest;
largest = arr[i];
} else if (arr[i] > secondLargest && arr[i] < largest) {
// Current element becomes second largest
secondLargest = arr[i];
}
}
return new int[]{largest, secondLargest};
}Editor is loading...
Leave a Comment