<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[2201_75733666的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/2201_75733666</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; 2201_75733666]]></copyright><item><title><![CDATA[数据结构-顺序表]]></title><link>https://blog.youkuaiyun.com/2201_75733666/article/details/140362117</link><guid>https://blog.youkuaiyun.com/2201_75733666/article/details/140362117</guid><author>2201_75733666</author><pubDate>Thu, 11 Jul 2024 21:04:37 +0800</pubDate><description><![CDATA[【代码】数据结构-顺序表。]]></description><category></category></item><item><title><![CDATA[全排列 和 排列 模板]]></title><link>https://blog.youkuaiyun.com/2201_75733666/article/details/137688032</link><guid>https://blog.youkuaiyun.com/2201_75733666/article/details/137688032</guid><author>2201_75733666</author><pubDate>Fri, 12 Apr 2024 17:30:00 +0800</pubDate><description><![CDATA[【代码】全排列 和 排列 模板。]]></description><category></category></item><item><title><![CDATA[gcd与lcm]]></title><link>https://blog.youkuaiyun.com/2201_75733666/article/details/137080169</link><guid>https://blog.youkuaiyun.com/2201_75733666/article/details/137080169</guid><author>2201_75733666</author><pubDate>Wed, 27 Mar 2024 15:53:47 +0800</pubDate><description><![CDATA[【代码】gcd与lcm。]]></description><category></category></item><item><title><![CDATA[【并查集】模版]]></title><link>https://blog.youkuaiyun.com/2201_75733666/article/details/136664400</link><guid>https://blog.youkuaiyun.com/2201_75733666/article/details/136664400</guid><author>2201_75733666</author><pubDate>Tue, 12 Mar 2024 21:50:34 +0800</pubDate><description><![CDATA[【代码】【并查集】模版。]]></description><category></category></item><item><title><![CDATA[蓝桥杯【01背包模版】【完全背包】牛客例题展示]]></title><link>https://blog.youkuaiyun.com/2201_75733666/article/details/136583649</link><guid>https://blog.youkuaiyun.com/2201_75733666/article/details/136583649</guid><author>2201_75733666</author><pubDate>Sat, 09 Mar 2024 15:02:25 +0800</pubDate><description><![CDATA[【代码】蓝桥杯之【01背包模版】牛客例题展示。]]></description><category></category></item><item><title><![CDATA[进制转换(详解) + 手撕代码]]></title><link>https://blog.youkuaiyun.com/2201_75733666/article/details/135949364</link><guid>https://blog.youkuaiyun.com/2201_75733666/article/details/135949364</guid><author>2201_75733666</author><pubDate>Wed, 31 Jan 2024 11:31:49 +0800</pubDate><description><![CDATA[【代码】进制转换(详解) + 手撕代码。]]></description><category></category></item><item><title><![CDATA[Shuffling Machine]]></title><link>https://blog.youkuaiyun.com/2201_75733666/article/details/135673146</link><guid>https://blog.youkuaiyun.com/2201_75733666/article/details/135673146</guid><author>2201_75733666</author><pubDate>Thu, 18 Jan 2024 14:15:28 +0800</pubDate><description><![CDATA[【代码】Shuffling Machine。]]></description><category></category></item><item><title><![CDATA[小明和完美序列——map]]></title><link>https://blog.youkuaiyun.com/2201_75733666/article/details/135671574</link><guid>https://blog.youkuaiyun.com/2201_75733666/article/details/135671574</guid><author>2201_75733666</author><pubDate>Thu, 18 Jan 2024 13:00:08 +0800</pubDate><description><![CDATA[【代码】小明和完美序列——map。]]></description><category></category></item><item><title><![CDATA[关于queue的两道编程题]]></title><link>https://blog.youkuaiyun.com/2201_75733666/article/details/135623175</link><guid>https://blog.youkuaiyun.com/2201_75733666/article/details/135623175</guid><author>2201_75733666</author><pubDate>Tue, 16 Jan 2024 15:10:24 +0800</pubDate><description><![CDATA[1.合并果子 - 蓝桥云课 (lanqiao.cn)]]></description><category></category></item><item><title><![CDATA[unique（）函数]]></title><link>https://blog.youkuaiyun.com/2201_75733666/article/details/135613435</link><guid>https://blog.youkuaiyun.com/2201_75733666/article/details/135613435</guid><author>2201_75733666</author><pubDate>Mon, 15 Jan 2024 23:19:17 +0800</pubDate><description><![CDATA[这篇博客是本人在学习算法中遇到的一个常用的函数，记录分享给大家。]]></description><category></category></item><item><title><![CDATA[vector 迭代器失效问题]]></title><link>https://blog.youkuaiyun.com/2201_75733666/article/details/135434440</link><guid>https://blog.youkuaiyun.com/2201_75733666/article/details/135434440</guid><author>2201_75733666</author><pubDate>Sun, 07 Jan 2024 00:46:40 +0800</pubDate><description><![CDATA[迭代器的主要作用就是让算法能够不用关心底层数据结构，其底层实际就是一个指针，或者是对指针进行了封装，比如：vector的迭代器就是原生态指针T*。]]></description><category></category></item><item><title><![CDATA[leetcode经典【双指针】例题]]></title><link>https://blog.youkuaiyun.com/2201_75733666/article/details/135429969</link><guid>https://blog.youkuaiyun.com/2201_75733666/article/details/135429969</guid><author>2201_75733666</author><pubDate>Sat, 06 Jan 2024 18:20:52 +0800</pubDate><description><![CDATA[题目：外面有宝，赶紧捡回来按序放好，不能重样哟 有点像小夫妻俩，老公q在外面淘宝，找到后运回来，找到一个新的宝，老婆p在家里就给挖个新坑放好，最后外面没宝了，就结束咯。（if） 老婆：这个没有，拿回来吧 （nums[p]!= nums[q]） 放好了，我到下一个位置等你（p++） 你再继续找吧(q++)（nums[p] == nums[q]）你再找找（q++）（nums[p] == nums[q]）你再找找（q++）如果不相等，将 q 位置的元素复制到 p+1 位置上，p 后移一位，q 后移 1 位。]]></description><category></category></item><item><title><![CDATA[leetcode——杨辉三角]]></title><link>https://blog.youkuaiyun.com/2201_75733666/article/details/135429728</link><guid>https://blog.youkuaiyun.com/2201_75733666/article/details/135429728</guid><author>2201_75733666</author><pubDate>Sat, 06 Jan 2024 17:59:43 +0800</pubDate><description><![CDATA[这道题要用vector，其实类似二维数组。因为本人最近正在学习vector，所以就把这道题用vector写了一下。核心思想：找出杨辉三角的规律，发现每一行头尾都是1，中间第[j]个数等于上一行[j-1]+ [j]在「杨辉三角」中，每个数是它左上方和右上方的数的和。生成「杨辉三角」的前 numRows。给定一个非负整数 numRows。]]></description><category></category></item><item><title><![CDATA[leetcode“位运算”——只出现一次的数字]]></title><link>https://blog.youkuaiyun.com/2201_75733666/article/details/135420214</link><guid>https://blog.youkuaiyun.com/2201_75733666/article/details/135420214</guid><author>2201_75733666</author><pubDate>Sat, 06 Jan 2024 00:47:04 +0800</pubDate><description><![CDATA[这道题其实告诉你有两个重复出现的数，就在提示你用异或了，用0依次与其他数异或，最后出现两次的都被消掉了，最后剩下的数就是只出现一次的数。给你一个整数数组 nums，除某个元素仅出现 一次外，其余每个元素都恰出现 三次。，除了某个元素只出现一次以外，其余每个元素均出现两次。找出那个只出现一次的元素。返回那个只出现了一次的元素。给你一个非空整数数组。]]></description><category></category></item><item><title><![CDATA[islower/isupper 和 tolower/toupper 大小写互换]]></title><link>https://blog.youkuaiyun.com/2201_75733666/article/details/135350450</link><guid>https://blog.youkuaiyun.com/2201_75733666/article/details/135350450</guid><author>2201_75733666</author><pubDate>Tue, 02 Jan 2024 21:40:06 +0800</pubDate><description><![CDATA[需要头文件<cctype>   islower和isupper是判断一个字符是否为大小写    大小写互换 ：]]></description><category></category></item><item><title><![CDATA[二分查找—binary_search,lower_bound,upper_bound]]></title><link>https://blog.youkuaiyun.com/2201_75733666/article/details/135349505</link><guid>https://blog.youkuaiyun.com/2201_75733666/article/details/135349505</guid><author>2201_75733666</author><pubDate>Tue, 02 Jan 2024 20:57:03 +0800</pubDate><description><![CDATA[【代码】二分查找—binary_search,lower_bound,upper_bound。]]></description><category></category></item><item><title><![CDATA[“手撕”＜STL＞——string类（详解+代码）]]></title><link>https://blog.youkuaiyun.com/2201_75733666/article/details/135023965</link><guid>https://blog.youkuaiyun.com/2201_75733666/article/details/135023965</guid><author>2201_75733666</author><pubDate>Tue, 02 Jan 2024 20:30:31 +0800</pubDate><description><![CDATA[1.string类对象的常见构造：


2.string类对象的容量操作：


这里分享一道leetcode上的题目，可以用范围for解决： 


 push_back( )  将字符c追加到字符串的末尾，使其长度增加1。append( )  通过在当前值的末尾附加额外字符来扩展字符串 ，append（）与push_back（）的区别是push_back( )只能追加单个字符，而append( )是追加字符串。


 我们来看看find( )和rfind( )的使用：


 下面我们来手撕一份代码，看看fi]]></description><category></category></item><item><title><![CDATA[max max_element 和 nth_element]]></title><link>https://blog.youkuaiyun.com/2201_75733666/article/details/135300575</link><guid>https://blog.youkuaiyun.com/2201_75733666/article/details/135300575</guid><author>2201_75733666</author><pubDate>Sat, 30 Dec 2023 00:40:55 +0800</pubDate><description><![CDATA[一种方法呢是用max_element，另一种方法是用sort函数，都差不多。]]></description><category></category></item><item><title><![CDATA[关于sort函数的使用]]></title><link>https://blog.youkuaiyun.com/2201_75733666/article/details/135299781</link><guid>https://blog.youkuaiyun.com/2201_75733666/article/details/135299781</guid><author>2201_75733666</author><pubDate>Fri, 29 Dec 2023 22:59:49 +0800</pubDate><description><![CDATA[这种思路是完全为了熟悉运用sort函数。其实大题小做了，可以先用sort函数将其变成默认的从小到大，然后再对其逆序输出即可。sort（）函数默认比较函数为"<",即是升序。如果要使其降序，需要自己编写比较函数进行实现。此文章仅为本人在备赛蓝桥杯学习时，对有关知识点的记录，供日后复习方便。这里的bool类型是为了当a>b时，返回true。]]></description><category></category></item><item><title><![CDATA[反转字符串中的字符]]></title><link>https://blog.youkuaiyun.com/2201_75733666/article/details/135072510</link><guid>https://blog.youkuaiyun.com/2201_75733666/article/details/135072510</guid><author>2201_75733666</author><pubDate>Mon, 18 Dec 2023 22:02:54 +0800</pubDate><description><![CDATA[【代码】反转字符串中的字符。]]></description><category></category></item></channel></rss>