思路：倒序单调栈。弹出所有 ≤ 当前身高的元素（这些人都能被看到），count 为弹出数量；若栈非空，还能看到栈顶（第一个更高的人），故 +1。能看到的人数 = count + (栈非空 ? 1 : 0)。
They've found what appears to be a small building and have unearthed domestic and decorative artefacts, including exquisite coloured glass beads.。WPS下载最新地址是该领域的重要参考
Essential digital access to quality FT journalism on any device. Pay a year upfront and save 20%.。业内人士推荐WPS官方版本下载作为进阶阅读
system may not always be able to understand the context of the code，推荐阅读搜狗输入法2026获取更多信息
instance.exports.run();