https://blog.youkuaiyun.com/candyguazh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/candygua/article/details/150273858https://blog.youkuaiyun.com/candygua/article/details/150273858candyguaTue, 12 Aug 2025 16:18:58 +0800https://blog.youkuaiyun.com/candygua/article/details/149545373https://blog.youkuaiyun.com/candygua/article/details/149545373candyguaTue, 22 Jul 2025 19:32:37 +0800https://blog.youkuaiyun.com/candygua/article/details/149541759https://blog.youkuaiyun.com/candygua/article/details/149541759candyguaTue, 22 Jul 2025 18:21:57 +0800https://blog.youkuaiyun.com/candygua/article/details/149440040https://blog.youkuaiyun.com/candygua/article/details/149440040candyguaSun, 20 Jul 2025 22:05:14 +0800https://blog.youkuaiyun.com/candygua/article/details/149421680https://blog.youkuaiyun.com/candygua/article/details/149421680candyguaThu, 17 Jul 2025 14:43:46 +0800https://blog.youkuaiyun.com/candygua/article/details/149417416https://blog.youkuaiyun.com/candygua/article/details/149417416candyguaThu, 17 Jul 2025 11:27:42 +0800left之后就进行输出值；这里重点说一下迭代，还是用栈来做这道题，因为中序遍历是先输出左下角的值，所以我们要先到最左下角，每走一步就压一个入栈，到了左下角再往回退，回退的操作就是从栈里面弹出元素。1.while的条件为cur!st.empty()。]]>https://blog.youkuaiyun.com/candygua/article/details/149415962https://blog.youkuaiyun.com/candygua/article/details/149415962candyguaThu, 17 Jul 2025 10:49:29 +0800https://blog.youkuaiyun.com/candygua/article/details/149402370https://blog.youkuaiyun.com/candygua/article/details/149402370candyguaWed, 16 Jul 2025 17:20:53 +0800https://blog.youkuaiyun.com/candygua/article/details/149389163https://blog.youkuaiyun.com/candygua/article/details/149389163candyguaWed, 16 Jul 2025 10:13:34 +0800https://blog.youkuaiyun.com/candygua/article/details/149339152https://blog.youkuaiyun.com/candygua/article/details/149339152candyguaMon, 14 Jul 2025 20:57:36 +0800https://blog.youkuaiyun.com/candygua/article/details/149334851https://blog.youkuaiyun.com/candygua/article/details/149334851candyguaMon, 14 Jul 2025 17:16:22 +0800https://blog.youkuaiyun.com/candygua/article/details/149323932https://blog.youkuaiyun.com/candygua/article/details/149323932candyguaMon, 14 Jul 2025 10:14:08 +0800https://blog.youkuaiyun.com/candygua/article/details/149323080https://blog.youkuaiyun.com/candygua/article/details/149323080candyguaMon, 14 Jul 2025 09:19:49 +0800https://blog.youkuaiyun.com/candygua/article/details/149273395https://blog.youkuaiyun.com/candygua/article/details/149273395candyguaFri, 11 Jul 2025 14:18:01 +0800https://blog.youkuaiyun.com/candygua/article/details/149182873https://blog.youkuaiyun.com/candygua/article/details/149182873candyguaMon, 07 Jul 2025 23:01:29 +0800https://blog.youkuaiyun.com/candygua/article/details/149174160https://blog.youkuaiyun.com/candygua/article/details/149174160candyguaMon, 07 Jul 2025 15:30:33 +0800https://blog.youkuaiyun.com/candygua/article/details/149160275https://blog.youkuaiyun.com/candygua/article/details/149160275candyguaSun, 06 Jul 2025 23:03:26 +0800next和cur->next->next是否为空指针就好了。这里需要创建两个临时变量用来保存当前对的第一个和下一对的第一个，图中就是1和3。（cur->next和cur->next->next->next），因为这两个变量刚刚好能顾及到当前循环的所有节点。2.每次更新cur节点，cur都是每对节点的前一个节点，所以更新cur的时候需要向后。]]>https://blog.youkuaiyun.com/candygua/article/details/149159506https://blog.youkuaiyun.com/candygua/article/details/149159506candyguaSun, 06 Jul 2025 22:23:05 +0800next），因为要改变cur->next = pre，所以提前保存一下。，向后更新，最终反转链表。]]>https://blog.youkuaiyun.com/candygua/article/details/149154675https://blog.youkuaiyun.com/candygua/article/details/149154675candyguaSun, 06 Jul 2025 16:32:54 +0800next，那么这个tmp就是我们要删除的元素了，看上面这个图，删除这个元素，仅仅是需要将cur的next直接指向tmp的next。然后在delete tmp，就完成了。]]>https://blog.youkuaiyun.com/candygua/article/details/149154422https://blog.youkuaiyun.com/candygua/article/details/149154422candyguaSun, 06 Jul 2025 16:24:07 +0800next;1.对于题目中的按照index来插入或者删除的题目，如果设置LinkedNode* cur = fakehead;在后续的while循环中while(index--)，结束是在index的。2.在尾插的时候，通过while(cur->next!3.任何增删链表后，记得改变size。对于链表我们采用在头节点之前创建一个。]]>