https://blog.youkuaiyun.com/Lumoryzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Lumory/article/details/140343363https://blog.youkuaiyun.com/Lumory/article/details/140343363LumoryThu, 11 Jul 2024 10:12:57 +0800https://blog.youkuaiyun.com/Lumory/article/details/140327436https://blog.youkuaiyun.com/Lumory/article/details/140327436LumoryWed, 10 Jul 2024 18:50:32 +0800https://blog.youkuaiyun.com/Lumory/article/details/140238661https://blog.youkuaiyun.com/Lumory/article/details/140238661LumoryWed, 10 Jul 2024 16:21:17 +0800https://blog.youkuaiyun.com/Lumory/article/details/140294725https://blog.youkuaiyun.com/Lumory/article/details/140294725LumoryTue, 09 Jul 2024 15:03:31 +0800https://blog.youkuaiyun.com/Lumory/article/details/140278066https://blog.youkuaiyun.com/Lumory/article/details/140278066LumoryTue, 09 Jul 2024 14:16:04 +0800https://blog.youkuaiyun.com/Lumory/article/details/140238294https://blog.youkuaiyun.com/Lumory/article/details/140238294LumorySun, 07 Jul 2024 01:02:27 +0800https://blog.youkuaiyun.com/Lumory/article/details/140155706https://blog.youkuaiyun.com/Lumory/article/details/140155706LumoryWed, 03 Jul 2024 17:38:13 +0800val。因为我们的判定条件里，如果是叶子结点直接就return了，没有机会减去这个值。这里保证了先左后右的顺序，所以在最后一层第一个遍历到的肯定是最左边的节点。这个depth--有点难理解，就是在某个节点用完以后，重新回到上一层。有一点思路，但不多，先把这题放着吧，累了。抄题解心得：原来可以把顺序交换达到目的。这次终于理解了递归这里夹杂的回溯。自己写当然还是写不出来。]]>https://blog.youkuaiyun.com/Lumory/article/details/140150803https://blog.youkuaiyun.com/Lumory/article/details/140150803LumoryWed, 03 Jul 2024 15:37:16 +0800https://blog.youkuaiyun.com/Lumory/article/details/140148953https://blog.youkuaiyun.com/Lumory/article/details/140148953LumoryWed, 03 Jul 2024 13:44:44 +0800https://blog.youkuaiyun.com/Lumory/article/details/140126628https://blog.youkuaiyun.com/Lumory/article/details/140126628LumoryTue, 02 Jul 2024 16:43:52 +0800https://blog.youkuaiyun.com/Lumory/article/details/139547394https://blog.youkuaiyun.com/Lumory/article/details/139547394LumorySat, 08 Jun 2024 17:41:43 +0800https://blog.youkuaiyun.com/Lumory/article/details/139546935https://blog.youkuaiyun.com/Lumory/article/details/139546935LumorySat, 08 Jun 2024 15:40:29 +0800https://blog.youkuaiyun.com/Lumory/article/details/139498776https://blog.youkuaiyun.com/Lumory/article/details/139498776LumoryThu, 06 Jun 2024 14:28:45 +0800https://blog.youkuaiyun.com/Lumory/article/details/139398126https://blog.youkuaiyun.com/Lumory/article/details/139398126LumorySun, 02 Jun 2024 21:50:13 +0800https://blog.youkuaiyun.com/Lumory/article/details/139362724https://blog.youkuaiyun.com/Lumory/article/details/139362724LumoryFri, 31 May 2024 22:40:51 +0800 ,operator++,operator--等指针相关操作予以重载的class template.所有STL容器都附带有自己专属的迭代器，只有容器的设计者才知道如何遍历自己的元素。栈和队列的内部结构，栈的底层实现可以是vector，deque，list 都是可以的， 主要就是数组和链表的底层实现。没有指定底层实现的时候，默认是以deque来实现的（SGI STL）。]]>https://blog.youkuaiyun.com/Lumory/article/details/139324326https://blog.youkuaiyun.com/Lumory/article/details/139324326LumoryThu, 30 May 2024 14:51:07 +0800https://blog.youkuaiyun.com/Lumory/article/details/139324296https://blog.youkuaiyun.com/Lumory/article/details/139324296LumoryThu, 30 May 2024 14:50:30 +0800https://blog.youkuaiyun.com/Lumory/article/details/139280331https://blog.youkuaiyun.com/Lumory/article/details/139280331LumoryTue, 28 May 2024 23:10:04 +0800https://blog.youkuaiyun.com/Lumory/article/details/139243644https://blog.youkuaiyun.com/Lumory/article/details/139243644LumoryMon, 27 May 2024 17:51:30 +0800https://blog.youkuaiyun.com/Lumory/article/details/139205601https://blog.youkuaiyun.com/Lumory/article/details/139205601LumorySat, 25 May 2024 23:44:20 +0800