No summary

I used prioritiy queue to solve this problem.

In this problem, we use three pointers to get no repeating tuples, one for iteration and two for shrinking the solution space.

This is a classic dynamic programming problem.

通过观察面积公式，如果我们想让面积最大，就要让(right_index - left_index)由最大值向0收敛，并且尽可能地提高Min(height[left_index], height[right_index])的“短板”。

Design a LRU cache

We can solve this problem in many ways.

No summary

This is a classic dynamic programming problem.

This is a classic dynamic programming problem.