https://blog.youkuaiyun.com/chh563zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/chh563/article/details/162770998https://blog.youkuaiyun.com/chh563/article/details/162770998chh563Sun, 12 Jul 2026 06:35:44 +0800if (_year!if (_month!// 大堆// 小堆大堆需要operator<，小堆需要operator>。或者通过仿函数/函数对象指定比较规则。]]>https://blog.youkuaiyun.com/chh563/article/details/162697617https://blog.youkuaiyun.com/chh563/article/details/162697617chh563Fri, 10 Jul 2026 21:21:33 +0800https://blog.youkuaiyun.com/chh563/article/details/162697505https://blog.youkuaiyun.com/chh563/article/details/162697505chh563Thu, 09 Jul 2026 14:34:48 +0800https://blog.youkuaiyun.com/chh563/article/details/160914728https://blog.youkuaiyun.com/chh563/article/details/160914728chh563Wed, 08 Jul 2026 14:44:55 +0800>，因为cin >>遇到空格就结束读取。while (getline(cin, line)) { // 必须用 getline，不能用 cin>>// 找到最后一个空格// 最后一个单词长度return 0;]]>https://blog.youkuaiyun.com/chh563/article/details/160055014https://blog.youkuaiyun.com/chh563/article/details/160055014chh563Sat, 11 Apr 2026 15:22:23 +0800 │。]]>https://blog.youkuaiyun.com/chh563/article/details/160052546https://blog.youkuaiyun.com/chh563/article/details/160052546chh563Sat, 11 Apr 2026 12:55:31 +0800https://blog.youkuaiyun.com/chh563/article/details/159921537https://blog.youkuaiyun.com/chh563/article/details/159921537chh563Tue, 07 Apr 2026 14:30:35 +0800https://blog.youkuaiyun.com/chh563/article/details/159433303https://blog.youkuaiyun.com/chh563/article/details/159433303chh563Thu, 26 Mar 2026 19:27:28 +0800https://blog.youkuaiyun.com/chh563/article/details/159317687https://blog.youkuaiyun.com/chh563/article/details/159317687chh563Wed, 25 Mar 2026 15:49:16 +0800https://blog.youkuaiyun.com/chh563/article/details/158930408https://blog.youkuaiyun.com/chh563/article/details/158930408chh563Mon, 16 Mar 2026 10:31:53 +0800https://blog.youkuaiyun.com/chh563/article/details/158886155https://blog.youkuaiyun.com/chh563/article/details/158886155chh563Wed, 11 Mar 2026 16:56:18 +0800= 0作为结束循环的条件，因为当parent = 0时，parent=(child-1)/2永远等于0，因此用child来做判断。HeakPop删除的是堆顶（根位置），不能使用覆盖方法，不然会使堆的数据关系全乱了。过程：先将堆顶数据与数组最后一个数据互换，然后删除最后一个数据，再进行向下调整算法。树结构，既要保存值域，也要保存节点与节点之间的关系。顺序存储就是用数组来存储，只适合完全二叉树，因为不是完全二叉树会有空间的浪费。要前k小数据就要求比堆顶数据小。]]>https://blog.youkuaiyun.com/chh563/article/details/158881034https://blog.youkuaiyun.com/chh563/article/details/158881034chh563Tue, 10 Mar 2026 15:05:00 +0800https://blog.youkuaiyun.com/chh563/article/details/158731696https://blog.youkuaiyun.com/chh563/article/details/158731696chh563Fri, 06 Mar 2026 11:07:58 +0800https://blog.youkuaiyun.com/chh563/article/details/158418282https://blog.youkuaiyun.com/chh563/article/details/158418282chh563Sat, 28 Feb 2026 13:00:44 +0800https://blog.youkuaiyun.com/chh563/article/details/157843505https://blog.youkuaiyun.com/chh563/article/details/157843505chh563Mon, 09 Feb 2026 07:43:18 +0800https://blog.youkuaiyun.com/chh563/article/details/157810489https://blog.youkuaiyun.com/chh563/article/details/157810489chh563Sat, 07 Feb 2026 12:49:13 +0800https://blog.youkuaiyun.com/chh563/article/details/157657983https://blog.youkuaiyun.com/chh563/article/details/157657983chh563Fri, 06 Feb 2026 09:44:09 +0800https://blog.youkuaiyun.com/chh563/article/details/157516792https://blog.youkuaiyun.com/chh563/article/details/157516792chh563Sun, 01 Feb 2026 12:55:21 +0800https://blog.youkuaiyun.com/chh563/article/details/157511503https://blog.youkuaiyun.com/chh563/article/details/157511503chh563Thu, 29 Jan 2026 18:54:11 +0800https://blog.youkuaiyun.com/chh563/article/details/157434255https://blog.youkuaiyun.com/chh563/article/details/157434255chh563Wed, 28 Jan 2026 19:25:02 +0800