最大值（整数数组）：

Arrays.stream(A).max().getAsInt()

int[] A = {6,7,8,2,1,3,4,5};
int maxVal = Arrays.stream(A).max().getAsInt();

最小值（整数数组）：

Arrays.stream(A).min().getAsInt()

int[] A = {6,7,8,2,1,3,4,5};
int minVal = Arrays.stream(A).min().getAsInt();

题目描述：

LeetCode 873. Length of Longest Fibonacci Subsequence

A sequence X_1, X_2, ..., X_n is fibonacci-like if:

• n >= 3
• X_i + X_{i+1} = X_{i+2} for all i + 2 <= n

Given a strictly increasing array A of positive ...

题目描述：

LeetCode 875. Koko Eating Bananas

Koko loves to eat bananas.  There are N piles of bananas, the i-th pile has piles[i] bananas.  The guards have gone and will come back in H hours.

Koko can decide her bananas-per-hour eating ...

题目描述：

LeetCode 871. Minimum Number of Refueling Stops

A car travels from a starting position to a destination which is target miles east of the starting position.

Along the way, there are gas stations.  Each station[i] represents a gas station ...

题目描述：

LeetCode 870. Advantage Shuffle

Given two arrays A and B of equal size, the advantage of A with respect to B is the number of indices i for which A[i] > B[i].

Return any permutation of A that ...