盛最多水的容器

/*
题目思路：
在Java Stream中解决这个问题不太直接，但我们可以将高度数组与其索引配对，
然后用Stream和Collectors进行两两比较。由于Stream是单向迭代，
因此我们仍然需要通过传统的双指针方式来遍历。
*/
import java.util.stream.IntStream;
import java.util.stream.Collectors;
import java.util.List;
 
public class Solution {
    public int maxArea(int[] height) {
        List<Integer> indices = IntStream.range(0, height.length).boxed().collect(Collectors.toList());
        int left = 0;
        int right = indices.size() - 1;
        int maxArea = 0;
        while (left < right) {
            int minHeight = Math.min(height[indices.get(left)], height[indices.get(right)]);
            int currentArea = minHeight * (indices.get(right) - indices.get(left));
            maxArea = Math.max(maxArea, currentArea);
            if (height[indices.get(left)] < height[indices.get(right)]) {
                left++;
            } else {
                right--;
            }
        }
        return maxArea;
    }
}