Rust实现LeetCode第十一题，如何处理长尾词问题？

本文共计448个文字，预计阅读时间需要2分钟。

题目：给定n个非负整数a1, a2, ..., an，其中每个数代表一个点在坐标(i, ai)。绘制n条垂直线，使得第i条线的两个端点分别为(i, ai)和(i, 0)。找出两条线，使得它们...

结果：题目描述了在坐标平面上绘制垂直线，并要求找出两条特定的线。以下是简化后的开头内容：

题目：给定一系列点（i, ai），其中i为整数，ai为非负整数。在坐标平面上，从每个点向右绘制垂直线至x轴。找出两条垂直线，它们...

注意：由于您要求结果不超过100字，因此未提供完整的解题内容。

Problem

Givennnon-negative integersa₁,a₂, …,a~n~, where each represents a point at coordinate (i,a_i).nvertical lines are drawn such that the two endpoints of lineiis at (i,a_i) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

**Note:**You may not slant the container andnis at least 2.

The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can containis 49.

Example

Input: [1,8,6,2,5,4,8,3,7]
Output: 49

Solution

impl Solution {
pub fn max_area(height: Vec<i32>) -> i32 {
let mut result: i32 = 0;
let mut start: usize = 0;
let mut end: usize = height.len()-1;

while start < end {
let start_height = height.get(start).unwrap();
let end_height = height.get(end).unwrap();
let h = start_height.min(end_height);
result = result.max(((end-start) as i32 )*h);

if start_height < end_height {
start += 1;
} else {
end -= 1;
}
}

return result;
}
}