<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Cicada_9的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Cicada_9</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Cicada_9]]></copyright><item><title><![CDATA[LeetCode 18. 四数之和]]></title><link>https://blog.youkuaiyun.com/Cicada_9/article/details/141097527</link><guid>https://blog.youkuaiyun.com/Cicada_9/article/details/141097527</guid><author>Cicada_9</author><pubDate>Sat, 10 Aug 2024 22:31:51 +0800</pubDate><description><![CDATA[for.i循环中判断是否跳出循环的条件: nums[i] > target && target > 0，因为存在负数可能(如: -5, -4, -3 , -2, -1, 0;target = -8，-5 > -8，但实际上是存在满足可能的)，所以target必须大于0时才能判断。​		当前nums[i] + nums[j] > target，但红色部分存在元素满足target，所以必须使用break跳出循环，而不是return返回res数组。先将nums数组排序后遍历，其中需要注意如下几点。]]></description><category></category></item><item><title><![CDATA[牛客周赛 Round 34]]></title><link>https://blog.youkuaiyun.com/Cicada_9/article/details/136818418</link><guid>https://blog.youkuaiyun.com/Cicada_9/article/details/136818418</guid><author>Cicada_9</author><pubDate>Mon, 18 Mar 2024 19:17:49 +0800</pubDate><description><![CDATA[s[i]判断这一段子串是否是偶数，如果是就存入vector，不是就继续搜索下一个字符。存入v后左值l变为上一个右值的下一个 l = i + 1。分情况讨论，如果q全是0、q的陡峭值大于1、q的陡峭值 = 0（首尾是否有0）]]></description><category></category></item><item><title><![CDATA[牛客周赛 Round 35]]></title><link>https://blog.youkuaiyun.com/Cicada_9/article/details/136770943</link><guid>https://blog.youkuaiyun.com/Cicada_9/article/details/136770943</guid><author>Cicada_9</author><pubDate>Sat, 16 Mar 2024 21:52:28 +0800</pubDate><description><![CDATA[牛客周赛 Round 35
A. 小红的字符串切割
#include &lt;bits/stdc++.h&gt;
using namespace std;

typedef pair&lt;int, int&gt; PII;

int main(){
    string s;
    cin &gt;&gt; s;
    for(int i = 0; i &lt; s.size(); i++){
        if(i == s.size() / 2) cout &lt;&lt; endl;
    ]]></description><category></category></item><item><title><![CDATA[牛客周赛 Round 36]]></title><link>https://blog.youkuaiyun.com/Cicada_9/article/details/136760261</link><guid>https://blog.youkuaiyun.com/Cicada_9/article/details/136760261</guid><author>Cicada_9</author><pubDate>Sat, 16 Mar 2024 12:42:18 +0800</pubDate><description><![CDATA[B.小红的小红矩阵构造https://ac.nowcoder.com/acm/contest/76609/B。C.小红的白色字符串 https://ac.nowcoder.com/acm/contest/76609/C。A.小红的数位删除 https://ac.nowcoder.com/acm/contest/76609/A。D.小红走矩阵 https://ac.nowcoder.com/acm/contest/76609/D。异或，两数的二进制相同输出0，不同输出1。两次循环分别固定行和列。]]></description><category></category></item><item><title><![CDATA[蓝桥杯2023 C++ 省B 岛屿个数]]></title><link>https://blog.youkuaiyun.com/Cicada_9/article/details/136518831</link><guid>https://blog.youkuaiyun.com/Cicada_9/article/details/136518831</guid><author>Cicada_9</author><pubDate>Wed, 06 Mar 2024 22:22:26 +0800</pubDate><description><![CDATA[开大数组，将图的外圈覆盖一圈海，从海开始搜起，如果是内海（被陆地环住的海）就不会被搜到，同理内海中的岛也不会被搜到。海洋搜8个方向，如果搜到陆地就bfs_land搜索整块陆地，每一次使用bfs_land证明答案+1。陆地搜上下左右4个方向。]]></description><category></category></item><item><title><![CDATA[蓝桥杯 2023 C++省 B 冶炼金属]]></title><link>https://blog.youkuaiyun.com/Cicada_9/article/details/136489691</link><guid>https://blog.youkuaiyun.com/Cicada_9/article/details/136489691</guid><author>Cicada_9</author><pubDate>Tue, 05 Mar 2024 20:59:33 +0800</pubDate><description><![CDATA[【代码】蓝桥杯 2023 C++省 B 冶炼金属。]]></description><category></category></item><item><title><![CDATA[蓝桥杯2023C++省B组 飞机降落]]></title><link>https://blog.youkuaiyun.com/Cicada_9/article/details/136488630</link><guid>https://blog.youkuaiyun.com/Cicada_9/article/details/136488630</guid><author>Cicada_9</author><pubDate>Tue, 05 Mar 2024 20:34:36 +0800</pubDate><description><![CDATA[【代码】蓝桥杯2023C++省B组 飞机降落。]]></description><category></category></item></channel></rss>