https://blog.youkuaiyun.com/Ruiallyzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Ruially/article/details/159965877https://blog.youkuaiyun.com/Ruially/article/details/159965877RuiallyWed, 08 Apr 2026 21:27:50 +0800https://blog.youkuaiyun.com/Ruially/article/details/159939580https://blog.youkuaiyun.com/Ruially/article/details/159939580RuiallyWed, 08 Apr 2026 08:56:05 +0800https://blog.youkuaiyun.com/Ruially/article/details/159779661https://blog.youkuaiyun.com/Ruially/article/details/159779661RuiallyFri, 03 Apr 2026 08:53:36 +0800https://blog.youkuaiyun.com/Ruially/article/details/159769487https://blog.youkuaiyun.com/Ruially/article/details/159769487RuiallyThu, 02 Apr 2026 21:25:04 +0800 建立一个映射函数mp用来找到根节点在中序遍历中的位置 —>递归build函数，而左右子树的后序遍历的区间，我觉得是里面的一个难点。左右子树中序遍历的区间很好看出来，因为k是根节点，所以左子树的中序遍历区间就是【il，k-1】，右子树同理；而这个后序遍历的区间咋看呢？因为中序遍历是左子树—>根—>右子树，后序遍历是左子树—>右子树—>根，所以所以其左子树的pl延续下来，又因为中序遍历和后序遍历的长度肯定是一致的，]]>https://blog.youkuaiyun.com/Ruially/article/details/159768824https://blog.youkuaiyun.com/Ruially/article/details/159768824RuiallyThu, 02 Apr 2026 19:54:21 +0800https://blog.youkuaiyun.com/Ruially/article/details/157433776https://blog.youkuaiyun.com/Ruially/article/details/157433776RuiallyTue, 27 Jan 2026 16:05:03 +0800https://blog.youkuaiyun.com/Ruially/article/details/157359605https://blog.youkuaiyun.com/Ruially/article/details/157359605RuiallySun, 25 Jan 2026 14:59:28 +0800> n >> c 读取完数字和字符后，输入缓冲区中会残留一个换行符 \n ，后续getline（）函数会直接读取这个空行，导致 s 变成空字符串。substr是sustring（子字符串）的缩写，作用是从一个字符串 s 中，按照指定的 “起始位置” 和 “截取长度”，提取出一小段新的字符串，根据它“只忽略/清除缓冲区里的【第一个字符】”的特性，它最常见的用法就是：清除缓冲区的换行符。（2）n的值比较小，只能从s的后面截取对应位数的char。]]>https://blog.youkuaiyun.com/Ruially/article/details/157328828https://blog.youkuaiyun.com/Ruially/article/details/157328828RuiallySat, 24 Jan 2026 21:30:00 +0800https://blog.youkuaiyun.com/Ruially/article/details/157291719https://blog.youkuaiyun.com/Ruially/article/details/157291719RuiallyFri, 23 Jan 2026 15:21:21 +0800https://blog.youkuaiyun.com/Ruially/article/details/156279232https://blog.youkuaiyun.com/Ruially/article/details/156279232RuiallySat, 27 Dec 2025 19:26:38 +0800https://blog.youkuaiyun.com/Ruially/article/details/156133348https://blog.youkuaiyun.com/Ruially/article/details/156133348RuiallySun, 21 Dec 2025 20:31:28 +0800https://blog.youkuaiyun.com/Ruially/article/details/156114968https://blog.youkuaiyun.com/Ruially/article/details/156114968RuiallySat, 20 Dec 2025 20:16:44 +0800https://blog.youkuaiyun.com/Ruially/article/details/156095806https://blog.youkuaiyun.com/Ruially/article/details/156095806RuiallyFri, 19 Dec 2025 19:58:52 +0800https://blog.youkuaiyun.com/Ruially/article/details/156061051https://blog.youkuaiyun.com/Ruially/article/details/156061051RuiallyThu, 18 Dec 2025 19:50:42 +0800https://blog.youkuaiyun.com/Ruially/article/details/156025888https://blog.youkuaiyun.com/Ruially/article/details/156025888RuiallyWed, 17 Dec 2025 20:21:01 +0800https://blog.youkuaiyun.com/Ruially/article/details/155965918https://blog.youkuaiyun.com/Ruially/article/details/155965918RuiallyTue, 16 Dec 2025 09:07:52 +0800https://blog.youkuaiyun.com/Ruially/article/details/155906689https://blog.youkuaiyun.com/Ruially/article/details/155906689RuiallyMon, 15 Dec 2025 20:00:02 +0800 2 => 1有着明显的递减规律，3是6的一半。针对第三个点，答案就很显然啦！]]>https://blog.youkuaiyun.com/Ruially/article/details/155905615https://blog.youkuaiyun.com/Ruially/article/details/155905615RuiallySun, 14 Dec 2025 10:02:00 +0800https://blog.youkuaiyun.com/Ruially/article/details/155892967https://blog.youkuaiyun.com/Ruially/article/details/155892967RuiallySun, 14 Dec 2025 09:41:52 +0800=前一次分解出的因数，所以是fenjie(k/i,i)先通过分解20来找规律：20 = 20 = 2*10 = 4*5 = 2*2*5 共4种。因为最先提出来的因数小，所以k/i才有可能继续提出因子，所以k/i作为下一步要分解的数。20 = 2*10 = 10 *2，显然这是两种分解方法是同一种。每进行一次分解，就要保证因数＞=前一次分解出的因数。但这个比较复杂，所以我参考了大佬的做法，现在开始~]]>