java 在列表中找到最大值,在Java 8中查找列表的最大值，最小值，總和和平均值...

我認爲了解問題的多個解決方案總是很好，可以選擇最適合問題的權利。這裏有一些其他的解決方案：

final List primes = Arrays.asList(2, 3, 5, 7, 11, 13, 17, 19, 23, 29);

找出最大

// MAX -- Solution 1

primes.stream() //

.max(Comparator.comparing(i -> i)) //

.ifPresent(max -> System.out.println("Maximum found is " + max));

// MAX -- Solution 2

primes.stream() //

.max((i1, i2) -> Integer.compare(i1, i2)) //

.ifPresent(max -> System.out.println("Maximum found is " + max));

// MAX -- Solution 3

int max = Integer.MIN_VALUE;

for (int i : primes) {

max = (i > max) ? i : max;

}

if (max == Integer.MIN_VALUE) {

System.out.println("No result found");

} else {

System.out.println("Maximum found is " + max);

}

// MAX -- Solution 4

max = Collections.max(primes);

System.out.println("Maximum found is " + max);

找出最小

// MIN -- Solution 1

primes.stream() //

.min(Comparator.comparing(i -> i)) //

.ifPresent(min -> System.out.println("Minimum found is " + min));

// MIN -- Solution 2

primes.stream() //

.max(Comparator.comparing(i -> -i)) //

.ifPresent(min -> System.out.println("Minimum found is " + min));

// MIN -- Solution 3

int min = Integer.MAX_VALUE;

for (int i : primes) {

min = (i < min) ? i : min;

}

if (min == Integer.MAX_VALUE) {

System.out.println("No result found");

} else {

System.out.println("Minimum found is " + min);

}

// MIN -- Solution 4

min = Collections.min(primes);

System.out.println("Minimum found is " + min);

查找平均

// AVERAGE -- Solution 1

primes.stream() //

.mapToInt(i -> i) //

.average() //

.ifPresent(avg -> System.out.println("Average found is " + avg));

// AVERAGE -- Solution 2

int sum = 0;

for (int i : primes) {

sum+=i;

}

if(primes.isEmpty()){

System.out.println("List is empty");

} else {

System.out.println("Average found is " + sum/(float)primes.size());

}

查找總和

// SUM -- Solution 1

int sum1 = primes.stream() //

.mapToInt(i -> i) //

.sum(); //

System.out.println("Sum found is " + sum1);

// SUM -- Solution 2

int sum2 = 0;

for (int i : primes) {

sum2+=i;

}

System.out.println("Sum found is " + sum2);

但像consice越好，所以我最喜歡的是：

// Find a maximum with java.Collections

Collections.max(primes);

// Find a minimum with java.Collections

Collections.min(primes);