<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Graduationisbad的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Graduationisbad</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Graduationisbad]]></copyright><item><title><![CDATA[代码随想录算法训练营42期第一章数组part02]]></title><link>https://blog.youkuaiyun.com/Graduationisbad/article/details/140531332</link><guid>https://blog.youkuaiyun.com/Graduationisbad/article/details/140531332</guid><author>Graduationisbad</author><pubDate>Thu, 18 Jul 2024 19:50:05 +0800</pubDate><description><![CDATA[这道算法题已经忘记了，只能暴力解法了，然后再看一遍解析，才想起来滑窗。有序数组的平方，之前做过，有印象双指针，直接画图秒解。977.有序数组的平方。209.长度最小的子数组。209.长度最小的子数组。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营42期第一章part01]]></title><link>https://blog.youkuaiyun.com/Graduationisbad/article/details/140530720</link><guid>https://blog.youkuaiyun.com/Graduationisbad/article/details/140530720</guid><author>Graduationisbad</author><pubDate>Thu, 18 Jul 2024 19:23:31 +0800</pubDate><description><![CDATA[if(nums[middle]>target)的时候，此时nums[middle]一定不是target,所以将right==middle-1。因为数组内存空间地址连续，所以在删除或者增添元素的时候，就难免要移动其他元素的地址。if(nums[middle]>target)，此时是左闭右开，将right==middle。当左闭右闭时，while(left<=right) 这时if判断的时候，注意右值的写法。关于二分查找，之前在代码随想录刷过一遍，隐约记得左闭右闭，左闭右开，两种方式。]]></description><category></category></item></channel></rss>