https://blog.youkuaiyun.com/C_Liu_zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/C_Liu_/article/details/157260755https://blog.youkuaiyun.com/C_Liu_/article/details/157260755C_Liu_Tue, 10 Feb 2026 20:49:56 +0800https://blog.youkuaiyun.com/C_Liu_/article/details/155129254https://blog.youkuaiyun.com/C_Liu_/article/details/155129254C_Liu_Sat, 22 Nov 2025 17:16:25 +0800https://blog.youkuaiyun.com/C_Liu_/article/details/154903527https://blog.youkuaiyun.com/C_Liu_/article/details/154903527C_Liu_Sat, 22 Nov 2025 10:30:17 +0800https://blog.youkuaiyun.com/C_Liu_/article/details/154799865https://blog.youkuaiyun.com/C_Liu_/article/details/154799865C_Liu_Sun, 16 Nov 2025 10:20:33 +0800https://blog.youkuaiyun.com/C_Liu_/article/details/154570385https://blog.youkuaiyun.com/C_Liu_/article/details/154570385C_Liu_Wed, 12 Nov 2025 14:19:43 +0800https://blog.youkuaiyun.com/C_Liu_/article/details/154408362https://blog.youkuaiyun.com/C_Liu_/article/details/154408362C_Liu_Thu, 06 Nov 2025 19:14:15 +0800https://blog.youkuaiyun.com/C_Liu_/article/details/154282822https://blog.youkuaiyun.com/C_Liu_/article/details/154282822C_Liu_Sun, 02 Nov 2025 16:42:42 +0800https://blog.youkuaiyun.com/C_Liu_/article/details/154242675https://blog.youkuaiyun.com/C_Liu_/article/details/154242675C_Liu_Sun, 02 Nov 2025 11:23:39 +0800https://blog.youkuaiyun.com/C_Liu_/article/details/154240322https://blog.youkuaiyun.com/C_Liu_/article/details/154240322C_Liu_Sat, 01 Nov 2025 16:06:26 +0800https://blog.youkuaiyun.com/C_Liu_/article/details/153980694https://blog.youkuaiyun.com/C_Liu_/article/details/153980694C_Liu_Sat, 01 Nov 2025 13:47:32 +0800 right之前找到，那么 left 和 right交换，然后right在和基准值交换。知道你不懂，别急，先来回顾一下快速排序的核心思想吧：对一个序列找基准值，小于基准值的放一边，大于基准值的放另一边，然后再在两边分别找新的基准值，以此类推。而我们要做的就是在每次基准值确定位置之后和 k -1作比较，如果小了，证明我们要找的数在右边，就继续在右边找基准值，反之，在左边找。]]>https://blog.youkuaiyun.com/C_Liu_/article/details/154155201https://blog.youkuaiyun.com/C_Liu_/article/details/154155201C_Liu_Sat, 01 Nov 2025 13:02:55 +0800https://blog.youkuaiyun.com/C_Liu_/article/details/153942498https://blog.youkuaiyun.com/C_Liu_/article/details/153942498C_Liu_Sun, 26 Oct 2025 23:55:38 +0800https://blog.youkuaiyun.com/C_Liu_/article/details/153705842https://blog.youkuaiyun.com/C_Liu_/article/details/153705842C_Liu_Sun, 26 Oct 2025 19:47:13 +0800https://blog.youkuaiyun.com/C_Liu_/article/details/153421008https://blog.youkuaiyun.com/C_Liu_/article/details/153421008C_Liu_Sun, 19 Oct 2025 10:47:48 +0800在命名空间 std 内list 是标准模板库里的重要内容，通过之前 string、vector、的学习，list 的学习就显得非常简单了，包括后面的一些 STL 也是，但是，每个 STL 都有其独特的地方，还需要我们继续深入。]]>https://blog.youkuaiyun.com/C_Liu_/article/details/152650991https://blog.youkuaiyun.com/C_Liu_/article/details/152650991C_Liu_Wed, 15 Oct 2025 00:05:13 +0800 ，并且 vector 是位于命名空间 std 内的。vector 本质上是一个模版，使用时需要指定类型。]]>https://blog.youkuaiyun.com/C_Liu_/article/details/153183643https://blog.youkuaiyun.com/C_Liu_/article/details/153183643C_Liu_Mon, 13 Oct 2025 12:32:55 +0800https://blog.youkuaiyun.com/C_Liu_/article/details/153079095https://blog.youkuaiyun.com/C_Liu_/article/details/153079095C_Liu_Sun, 12 Oct 2025 00:01:15 +0800https://blog.youkuaiyun.com/C_Liu_/article/details/152971810https://blog.youkuaiyun.com/C_Liu_/article/details/152971810C_Liu_Sat, 11 Oct 2025 16:29:30 +0800https://blog.youkuaiyun.com/C_Liu_/article/details/152004953https://blog.youkuaiyun.com/C_Liu_/article/details/152004953C_Liu_Sun, 05 Oct 2025 11:30:11 +0800，同时也是有命名空间的 ：std。]]>https://blog.youkuaiyun.com/C_Liu_/article/details/151766464https://blog.youkuaiyun.com/C_Liu_/article/details/151766464C_Liu_Wed, 17 Sep 2025 18:00:03 +0800