-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFindLargest.java
More file actions
40 lines (33 loc) · 1.27 KB
/
Copy pathFindLargest.java
File metadata and controls
40 lines (33 loc) · 1.27 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
import java.util.Arrays;
public class FindLargest {
public static int findLargest(int[] nums) {
int largest = nums[0];
for (int num : nums) {
if (num > largest) {
largest = num;
}
}
return largest;
}
public static int findMallest(int[] nums) {
return Arrays.stream(nums).min().getAsInt();
}
public static int findSecondLargest(int[] nums) {
return Arrays.stream(nums)
.distinct() // Remove duplicates
.boxed() // IntStream -> Stream<Integer>
.sorted((a, b) -> b - a) // Descending order
.skip(1) // Skip largest
.findFirst() // Get second largest
.orElseThrow(() ->
new IllegalArgumentException(
"Array must contain at least two distinct values"));
}
public static void main(String[] args) {
int[] numbers = {10, 5, 19, 8, 20, 15};
int result = findLargest(numbers);
System.out.println("Largest Element: " + result);
System.out.println("Mallest Element: " + findMallest(numbers));
System.out.println("Mallest Element: " + findSecondLargest(numbers));
}
}