<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[GINA102504_的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/GINA102504_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; GINA102504_]]></copyright><item><title><![CDATA[Java笔记]]></title><link>https://blog.youkuaiyun.com/GINA102504_/article/details/130098236</link><guid>https://blog.youkuaiyun.com/GINA102504_/article/details/130098236</guid><author>GINA102504_</author><pubDate>Wed, 12 Apr 2023 09:02:43 +0800</pubDate><description><![CDATA[由数字、字母、下划线和美元符组成；小的给大的----->直接给。]]></description><category></category></item><item><title><![CDATA[BFS广搜——队列]]></title><link>https://blog.youkuaiyun.com/GINA102504_/article/details/130020035</link><guid>https://blog.youkuaiyun.com/GINA102504_/article/details/130020035</guid><author>GINA102504_</author><pubDate>Fri, 07 Apr 2023 21:45:41 +0800</pubDate><description><![CDATA[入队：push队尾出队：pop队首判断队列是否为空：while(!q.empty())访问队首元素：front（）先访问对首，再拿对首q.front()q.pop()q.push(初始状态）while(!q.pop();for(枚举a的所有可达状态v){if(本状态v合法）{执行标记操作;q.push(v);]]></description><category></category></item><item><title><![CDATA[DFS（深度优先搜索）]]></title><link>https://blog.youkuaiyun.com/GINA102504_/article/details/129969534</link><guid>https://blog.youkuaiyun.com/GINA102504_/article/details/129969534</guid><author>GINA102504_</author><pubDate>Wed, 05 Apr 2023 20:58:52 +0800</pubDate><description><![CDATA[模板dfs可以用递归来写，也可以用来写dfs很难找到最优解，只用来找到，内存消耗较小dfs如果需要，就需要模板边界if(判断边界) {//终止条件......return;(返回上一步)遍历 搜索i < 可扩展的路径数;i++){//遍历......(标记)(递归)//下一种情况(取消标记)]]></description><category></category></item><item><title><![CDATA[【无标题】]]></title><link>https://blog.youkuaiyun.com/GINA102504_/article/details/129910915</link><guid>https://blog.youkuaiyun.com/GINA102504_/article/details/129910915</guid><author>GINA102504_</author><pubDate>Sun, 02 Apr 2023 21:13:57 +0800</pubDate><description><![CDATA[2.任选其中一点写入排序队列。擦掉，重复找无入度顶点。1.找到无入度的顶点。]]></description><category></category></item><item><title><![CDATA[并查集——树形数据结构]]></title><link>https://blog.youkuaiyun.com/GINA102504_/article/details/129909756</link><guid>https://blog.youkuaiyun.com/GINA102504_/article/details/129909756</guid><author>GINA102504_</author><pubDate>Sun, 02 Apr 2023 14:34:29 +0800</pubDate><description><![CDATA[f[ ] 初始化:每个节点是一个集合，每个节点的父节点是它自己。根节点是集合的代表查找就是找到元素所在集合的根。1.如果父节点等于自己，则找到了根并返回。:把一个集合的根指向另一个集合的根。2.如果还没找到根，则继续递归查找。:确定某个元素处在哪个集合。f[x]为结点x的父节点。]]></description><category></category></item><item><title><![CDATA[数学分析能力+蓝桥杯简单题]]></title><link>https://blog.youkuaiyun.com/GINA102504_/article/details/129891339</link><guid>https://blog.youkuaiyun.com/GINA102504_/article/details/129891339</guid><author>GINA102504_</author><pubDate>Sat, 01 Apr 2023 21:05:56 +0800</pubDate><description><![CDATA[质数要叫素数，是在大于1的自然数，除了1和它本身外，不能被其他自然数整除的数。]]></description><category></category></item><item><title><![CDATA[动态规划线性dp]]></title><link>https://blog.youkuaiyun.com/GINA102504_/article/details/129866844</link><guid>https://blog.youkuaiyun.com/GINA102504_/article/details/129866844</guid><author>GINA102504_</author><pubDate>Thu, 30 Mar 2023 23:29:35 +0800</pubDate><description><![CDATA[【代码】动态规划线性dp。]]></description><category></category></item><item><title><![CDATA[日期问题。]]></title><link>https://blog.youkuaiyun.com/GINA102504_/article/details/129626387</link><guid>https://blog.youkuaiyun.com/GINA102504_/article/details/129626387</guid><author>GINA102504_</author><pubDate>Sat, 18 Mar 2023 11:58:58 +0800</pubDate><description><![CDATA[基姆•拉尔森公式可以由公历的年月日推导出当天的星期。d 为日期，范围是1-31m 为月份，范围是3-14，当年的1，2月需处理为上一年的13，14月。y为年份，当月份为1，2时，y需减一。结果w为0-6，星期日用0表示，星期一为1，以此类推，星期六为6。]]></description><category></category></item><item><title><![CDATA[基础排序算法]]></title><link>https://blog.youkuaiyun.com/GINA102504_/article/details/129475045</link><guid>https://blog.youkuaiyun.com/GINA102504_/article/details/129475045</guid><author>GINA102504_</author><pubDate>Sun, 12 Mar 2023 16:11:38 +0800</pubDate><description><![CDATA[先找一个中间点，mid =(l+r)/2  分为左边和右边；左开始找大的，右开始找小的。大-->   ]]></description><category></category></item><item><title><![CDATA[前缀和与差分]]></title><link>https://blog.youkuaiyun.com/GINA102504_/article/details/129459871</link><guid>https://blog.youkuaiyun.com/GINA102504_/article/details/129459871</guid><author>GINA102504_</author><pubDate>Sat, 11 Mar 2023 13:00:42 +0800</pubDate><description><![CDATA[前缀和与差分]]></description><category></category></item><item><title><![CDATA[DFS算法]]></title><link>https://blog.youkuaiyun.com/GINA102504_/article/details/129050050</link><guid>https://blog.youkuaiyun.com/GINA102504_/article/details/129050050</guid><author>GINA102504_</author><pubDate>Sun, 19 Feb 2023 11:20:36 +0800</pubDate><description><![CDATA[蓝桥练习]]></description><category></category></item><item><title><![CDATA[斐波那契1，1，2，3，5，8，13，21，34，55，89...]]></title><link>https://blog.youkuaiyun.com/GINA102504_/article/details/128747884</link><guid>https://blog.youkuaiyun.com/GINA102504_/article/details/128747884</guid><author>GINA102504_</author><pubDate>Sun, 22 Jan 2023 00:58:47 +0800</pubDate><description><![CDATA[fib]]></description><category></category></item><item><title><![CDATA[冒泡排序（C语言）]]></title><link>https://blog.youkuaiyun.com/GINA102504_/article/details/128747612</link><guid>https://blog.youkuaiyun.com/GINA102504_/article/details/128747612</guid><author>GINA102504_</author><pubDate>Sat, 21 Jan 2023 23:26:40 +0800</pubDate><description><![CDATA[冒泡排序。]]></description><category></category></item><item><title><![CDATA[统计大写辅音字母]]></title><link>https://blog.youkuaiyun.com/GINA102504_/article/details/128198487</link><guid>https://blog.youkuaiyun.com/GINA102504_/article/details/128198487</guid><author>GINA102504_</author><pubDate>Tue, 06 Dec 2022 10:30:58 +0800</pubDate><description><![CDATA[c语言基础小题]]></description><category></category></item><item><title><![CDATA[背包问题！]]></title><link>https://blog.youkuaiyun.com/GINA102504_/article/details/128086186</link><guid>https://blog.youkuaiyun.com/GINA102504_/article/details/128086186</guid><author>GINA102504_</author><pubDate>Mon, 28 Nov 2022 20:31:09 +0800</pubDate><description><![CDATA[算法01背包
]]></description><category></category></item></channel></rss>