<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[saya21的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/saya21</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; saya21]]></copyright><item><title><![CDATA[读取Jar包下文件资源的问题及解决方案]]></title><link>https://blog.youkuaiyun.com/saya21/article/details/139866012</link><guid>https://blog.youkuaiyun.com/saya21/article/details/139866012</guid><author>saya21</author><pubDate>Fri, 21 Jun 2024 17:20:56 +0800</pubDate><description><![CDATA[这样项目B是读取不到文件的。]]></description><category></category></item><item><title><![CDATA[二叉查找树、平衡二叉树、红黑树到底怎么插入调整？不用旋转快速实现]]></title><link>https://blog.youkuaiyun.com/saya21/article/details/132499948</link><guid>https://blog.youkuaiyun.com/saya21/article/details/132499948</guid><author>saya21</author><pubDate>Fri, 25 Aug 2023 19:48:41 +0800</pubDate><description><![CDATA[其中20、30下面是空的，所以它们的孩子节点10、35可以直接插入原来的位置，26的原来的孩子节点25、27不能直接放在26的下面，他的左孩子25放到他的左子树，20右孩子27放到他的右子树30（左放左，右放右）。步骤1和2都比较好理解，步骤3两种方式都可以，这么做的原因是我们想要找到的是比当前删除节点大的最小值，或者是比当前节点小的最大值，比如{1，2，3，4，重组后红色节点的孩子还是按照原来的排列，黑色的父亲节点原来的孩子：左边的孩子给父亲节点的左边，右边的孩子给父亲节点的右边（左给左，右给右）。]]></description><category></category></item><item><title><![CDATA[Java字符串常量池以及new String(“abc“)到底创建了几个对象？各种字符串到底相不相等？]]></title><link>https://blog.youkuaiyun.com/saya21/article/details/132093048</link><guid>https://blog.youkuaiyun.com/saya21/article/details/132093048</guid><author>saya21</author><pubDate>Fri, 04 Aug 2023 08:55:43 +0800</pubDate><description><![CDATA[存放位置字面量（双引号引的）放在字符串常量池中，new出来的对象都放在堆中。字符串拼接如果两个字符串都是直接用双引号引的，拼接时在编译期就会对其进行优化，例如String s = “a” + "b"会直接优化为String s = “ab”，这样创建出来的对象在常量池中。]]></description><category></category></item><item><title><![CDATA[Maven右侧依赖Dependencies消失]]></title><link>https://blog.youkuaiyun.com/saya21/article/details/132023110</link><guid>https://blog.youkuaiyun.com/saya21/article/details/132023110</guid><author>saya21</author><pubDate>Mon, 31 Jul 2023 15:33:10 +0800</pubDate><description><![CDATA[更改后又出现一个问题，重新点进设置里，Maven还是原来的路径，此时只要删除项目.mvn下的wrapper下的maven-wrapper.properties文件，然后重新设置路径。]]></description><category></category></item><item><title><![CDATA[synchronized：锁的对象到底是谁？快速理解八锁现象]]></title><link>https://blog.youkuaiyun.com/saya21/article/details/131888315</link><guid>https://blog.youkuaiyun.com/saya21/article/details/131888315</guid><author>saya21</author><pubDate>Mon, 24 Jul 2023 09:30:03 +0800</pubDate><description><![CDATA[通过总结和例子帮助快速理解八锁现象。]]></description><category></category></item><item><title><![CDATA[Java集合底层原理总结]]></title><link>https://blog.youkuaiyun.com/saya21/article/details/130874865</link><guid>https://blog.youkuaiyun.com/saya21/article/details/130874865</guid><author>saya21</author><pubDate>Thu, 25 May 2023 21:52:36 +0800</pubDate><description><![CDATA[HashSet、LinkedHashMap、TreeSet底层都是基于Map实现的，也就是Map中的底层结构是和Set类似的，只是Map中是根据Key值判断是否存在某元素。我们只要熟悉了Set，Map的原理和Set都是类似的。当添加第一个元素时，数组大小才为10，否则为空。当添加单个元素时，超过数组大小则数组扩容为原来的1.5倍，当添加多个元素时，超过数组大小则以添加的元素多少进行扩容。：ArrayList是一个。HashSet默认创建长度。]]></description><category></category></item><item><title><![CDATA[快速理解会话跟踪技术Cookie和Session]]></title><link>https://blog.youkuaiyun.com/saya21/article/details/130869998</link><guid>https://blog.youkuaiyun.com/saya21/article/details/130869998</guid><author>saya21</author><pubDate>Thu, 25 May 2023 20:31:41 +0800</pubDate><description><![CDATA[快速理解会话跟踪技术]]></description><category></category></item><item><title><![CDATA[【Mysql】Java连接Mysql数据库异常/连接失败/时区异常]]></title><link>https://blog.youkuaiyun.com/saya21/article/details/129803501</link><guid>https://blog.youkuaiyun.com/saya21/article/details/129803501</guid><author>saya21</author><pubDate>Mon, 27 Mar 2023 20:45:51 +0800</pubDate><description><![CDATA[检查pom.xml下mysql版本和自己的版本是否一致，如果不一致，把pom下的版本改成自己实际的版本。]]></description><category></category></item><item><title><![CDATA[【算法】记忆化搜索]]></title><link>https://blog.youkuaiyun.com/saya21/article/details/129158852</link><guid>https://blog.youkuaiyun.com/saya21/article/details/129158852</guid><author>saya21</author><pubDate>Wed, 22 Feb 2023 17:06:48 +0800</pubDate><description><![CDATA[记忆化搜索题型概况]]></description><category></category></item><item><title><![CDATA[【算法】动态规划（背包问题，持续更新……）]]></title><link>https://blog.youkuaiyun.com/saya21/article/details/129081051</link><guid>https://blog.youkuaiyun.com/saya21/article/details/129081051</guid><author>saya21</author><pubDate>Mon, 20 Feb 2023 17:03:09 +0800</pubDate><description><![CDATA[动态规划算法+力扣刷题]]></description><category></category></item><item><title><![CDATA[【长尾学习论文总结】]]></title><link>https://blog.youkuaiyun.com/saya21/article/details/126829828</link><guid>https://blog.youkuaiyun.com/saya21/article/details/126829828</guid><author>saya21</author><pubDate>Tue, 13 Sep 2022 15:57:37 +0800</pubDate><description><![CDATA[问题：和传统意义上数据增强的样本有所不同，这更符合分类器眼中的“增强”样本，这样得到的新样本是否真的具有少数类样本的特征？通过添加BatchFormer模块，在一个Batch里，建立单个样本与其它样本的关系，该模块能够即插即用，适用于很多工作。该文章假设类别特征服从高斯分布，统计基类的均值和协方差，与新类结合，得到新的均值和协方差，由此生成新样本。通过给多数类样本增加一个扰动，使得多数类样本能够转变为少数类样本，从而获得新的少数类样本。将上一篇论文的方法应用到长尾分类中。上一篇论文应用到长尾分类中。]]></description><category></category></item><item><title><![CDATA[1152 Google Recruitment]]></title><link>https://blog.youkuaiyun.com/saya21/article/details/126620082</link><guid>https://blog.youkuaiyun.com/saya21/article/details/126620082</guid><author>saya21</author><pubDate>Wed, 31 Aug 2022 11:15:17 +0800</pubDate><description><![CDATA[The natural constant e is a well known transcendental number（超越数）. The first several digits are: e = 2.718281828459045235360287471352662497757247093699959574966967627724076630353547594571382178525166427427466391932003059921…]]></description><category></category></item><item><title><![CDATA[1140 Look-and-say Sequence]]></title><link>https://blog.youkuaiyun.com/saya21/article/details/126619974</link><guid>https://blog.youkuaiyun.com/saya21/article/details/126619974</guid><author>saya21</author><pubDate>Wed, 31 Aug 2022 11:09:29 +0800</pubDate><description><![CDATA[【代码】1140 Look-and-say Sequence。]]></description><category></category></item><item><title><![CDATA[1164 Good in C]]></title><link>https://blog.youkuaiyun.com/saya21/article/details/126547768</link><guid>https://blog.youkuaiyun.com/saya21/article/details/126547768</guid><author>saya21</author><pubDate>Fri, 26 Aug 2022 17:37:41 +0800</pubDate><description><![CDATA[【代码】1164 Good in C。]]></description><category></category></item><item><title><![CDATA[PAT（甲级）2021年冬季考试 7-3 Size of Military Unit]]></title><link>https://blog.youkuaiyun.com/saya21/article/details/126545292</link><guid>https://blog.youkuaiyun.com/saya21/article/details/126545292</guid><author>saya21</author><pubDate>Fri, 26 Aug 2022 16:05:12 +0800</pubDate><description><![CDATA[【代码】PAT（甲级）2021年冬季考试 7-3 Size of Military Unit。]]></description><category></category></item><item><title><![CDATA[PAT（甲级）2021年冬季考试 7-2 Rank a Linked List]]></title><link>https://blog.youkuaiyun.com/saya21/article/details/126544690</link><guid>https://blog.youkuaiyun.com/saya21/article/details/126544690</guid><author>saya21</author><pubDate>Fri, 26 Aug 2022 15:41:30 +0800</pubDate><description><![CDATA[【代码】PAT（甲级）2021年冬季考试 7-2 Rank a Linked List。]]></description><category></category></item><item><title><![CDATA[PAT（甲级）2021年冬季考试 7-1 Fake News]]></title><link>https://blog.youkuaiyun.com/saya21/article/details/126544408</link><guid>https://blog.youkuaiyun.com/saya21/article/details/126544408</guid><author>saya21</author><pubDate>Fri, 26 Aug 2022 15:36:24 +0800</pubDate><description><![CDATA[PAT甲级]]></description><category></category></item><item><title><![CDATA[【算法笔记】并查集：好朋友和1107 Social Clusters 测试点2问题]]></title><link>https://blog.youkuaiyun.com/saya21/article/details/125892706</link><guid>https://blog.youkuaiyun.com/saya21/article/details/125892706</guid><author>saya21</author><pubDate>Wed, 20 Jul 2022 15:10:14 +0800</pubDate><description><![CDATA[设定初始化、查找父结点、合并三个方法，先初始化father数组，再针对朋友a、b，如果朋友a、b的父结点为同一个，即在同一个社交网络里，则不用合并a、b，否则将a、b合并到同一网络中。最后循环所有结点，判断它们的父结点是否出现过，来计算所有组数。......]]></description><category></category></item><item><title><![CDATA[查看显卡型号]]></title><link>https://blog.youkuaiyun.com/saya21/article/details/125601446</link><guid>https://blog.youkuaiyun.com/saya21/article/details/125601446</guid><author>saya21</author><pubDate>Mon, 04 Jul 2022 15:36:32 +0800</pubDate><description><![CDATA[linux中直接输入nvidia-smi -L]]></description><category></category></item><item><title><![CDATA[LaTex]]></title><link>https://blog.youkuaiyun.com/saya21/article/details/125049589</link><guid>https://blog.youkuaiyun.com/saya21/article/details/125049589</guid><author>saya21</author><pubDate>Mon, 30 May 2022 16:47:49 +0800</pubDate><description><![CDATA[行内公式
$$

段落公式
\begin{equation}
\end{equation}

公式和正文中的符号表示有略微差异，如帽子符号在正文中直接用\^{}，在公式中\hat{}

]]></description><category></category></item></channel></rss>