* 核心思路：链表转数组 + 单调栈（从后往前遍历），时间复杂度O(n)，空间复杂度O(n)
Move all objects where page_info(h)->count=0 onto
，推荐阅读WPS官方版本下载获取更多信息
想象一下，你跑步时心率升高，指环感知并提议补充外星人电解质饮料；你路过橱窗时短暂驻足，眼镜捕捉视线并推送优惠信息……
“We have some really wonderful people who are the old guard that feel like they are the comfortable welders, and they’re all very wise,” he said. “But even in the newest editions, we’re not here because we think that it’s all going to be done within our lifetimes. We like to joke about 2090 and about raising our children to work on the project. We just like to look at the next release, and that tends to be exciting enough to get us going.”