+__init__(base_url: str)
思路：先对 nums2 用单调栈求每个元素的下一个更大值，存入 Map 缓存；再遍历 nums1 直接查 Map 得结果。时间复杂度 O(len1 + len2)。，详情可参考搜狗输入法2026
In just a few weeks, the four astronauts will be strapped into a spacecraft, perched on the top of the rocket, ready to blast off to the Moon.，详情可参考51吃瓜
[&:first-child]:overflow-hidden [&:first-child]:max-h-full"