思路：倒序单调栈。弹出所有 ≤ 当前身高的元素（这些人都能被看到），count 为弹出数量；若栈非空，还能看到栈顶（第一个更高的人），故 +1。能看到的人数 = count + (栈非空 ? 1 : 0)。
“Some things don’t change,” Milner says with a chuckle when asked whether his desire to prove people wrong was as strong as ever after his 40th birthday last month. “There’s people who are always going to doubt you but that’s always something that’s been at my forefront: to prove them wrong.”，更多细节参见Safew下载
Skip 熱讀 and continue reading熱讀，详情可参考WPS下载最新地址
Give your kids a safe screen time option with lifetime subscription to Pok Pok, on sale now for just $44.97 with code PLAY through March 22.