xxxxxxxxxx
Integer[] num = { 2, 4, 7, 5, 9 };
// using Collections.min() to find minimum element
// using only 1 line.
int min1 = Collections.min(Arrays.asList(num));
// using Collections.max() to find maximum element
// using only 1 line.
int max1 = Collections.max(Arrays.asList(num));
System.out.println(min1); // 2
System.out.println(max1); // 9
xxxxxxxxxx
public int max()
{
int max = elementData[0];
for (int i = 1; i < size; i++)
{
if (elementData[i] > max)
{
max = elementData[i];
}
}
return max;
}
xxxxxxxxxx
public static double max(double[] arr) {
double result = arr[0];
for (int i = 1; i < arr.length; ++i) {
if (result < arr[i]) result = arr[i];
}
return result;
}
xxxxxxxxxx
public static double arrayMax(double[] arr) {
double max = Double.NEGATIVE_INFINITY;
for(double cur: arr)
max = Math.max(max, cur);
return max;
}
xxxxxxxxxx
public static String max(String[] arr) {
String result = arr[0];
for (int i = 1; i < arr.length; ++i) {
if (result.compareTo(arr[i]) < 0) result = arr[i];
}
return result;
}
xxxxxxxxxx
// Java program to find minimum (or maximum)
// element in an array.
import java.io.*;
class GFG {
static int getMin(int arr[], int n)
{
int res = arr[0];
for (int i = 1; i < n; i++)
res = Math.min(res, arr[i]);
return res;
}
static int getMax(int arr[], int n)
{
int res = arr[0];
for (int i = 1; i < n; i++)
res = Math.max(res, arr[i]);
return res;
}
// Driver code
public static void main(String[] args)
{
int arr[] = { 12, 1234, 45, 67, 1 };
int n = arr.length;
System.out.println("Minimum element of array: " + getMin(arr, n));
System.out.println("Maximum element of array: " + getMax(arr, n));
}
}
// This code is contributed by Aditya Kumar (adityakumar129)
xxxxxxxxxx
// Java program of above implementation
public class GFG {
/* Class Pair is used to return two values from getMinMax() */
static class Pair {
int min;
int max;
}
static Pair getMinMax(int arr[], int n) {
Pair minmax = new Pair();
int i;
/*If there is only one element then return it as min and max both*/
if (n == 1) {
minmax.max = arr[0];
minmax.min = arr[0];
return minmax;
}
/* If there are more than one elements, then initialize min
and max*/
if (arr[0] > arr[1]) {
minmax.max = arr[0];
minmax.min = arr[1];
} else {
minmax.max = arr[1];
minmax.min = arr[0];
}
for (i = 2; i < n; i++) {
if (arr[i] > minmax.max) {
minmax.max = arr[i];
} else if (arr[i] < minmax.min) {
minmax.min = arr[i];
}
}
return minmax;
}
/* Driver program to test above function */
public static void main(String args[]) {
int arr[] = {1000, 11, 445, 1, 330, 3000};
int arr_size = 6;
Pair minmax = getMinMax(arr, arr_size);
System.out.printf("\nMinimum element is %d", minmax.min);
System.out.printf("\nMaximum element is %d", minmax.max);
}
}
xxxxxxxxxx
import java.util.Random;
public class Main {
public static void main(String[] args) {
int a[] = new int [100];
Random rnd = new Random ();
for (int i = 0; i< a.length; i++) {
a[i] = rnd.nextInt(99-0)+0;
System.out.println(a[i]);
}
int max = 0;
for (int i = 0; i < a.length; i++) {
a[i] = max;
for (int j = i+1; j<a.length; j++) {
if (a[j] > max) {
max = a[j];
}
}
}
System.out.println("Max element: " + max);
}
}
xxxxxxxxxx
int[] /*OR*/ double[] /*OR*/ float[] array_of_numbers = {/*Whatever values you want*/}
/*For this example we're just using a regular integer array*/
int max = 0; /*Important to initialise the max value as ZERO*/
for (int i = 0; i < array_of_numbers.length; i++) {
if(array_of_numbers[i] > max) { /* So now we can make the comparison*/
max = array_of_numbers[i]; /* If larger, make it the new maximum*/
}
}
System.out.println("Maximum value in array: " + max)