<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[gmail_82410的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/gmail_82410</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; gmail_82410]]></copyright><item><title><![CDATA[BPF学习——一个完整的eBPF工程代码如何编写]]></title><link>https://blog.youkuaiyun.com/gmail_82410/article/details/150393226</link><guid>https://blog.youkuaiyun.com/gmail_82410/article/details/150393226</guid><author>gmail_82410</author><pubDate>Fri, 15 Aug 2025 17:33:21 +0800</pubDate><description><![CDATA[这个函数就是记录sched_process_exec的执行时间的，上面的SEC是挂载到sched_process_exec，下面的挂载到sched_process_exit，上面的函数将开始时间存到map中，下面的函数就计算两个时间的差值，从而知道这个事件的执行时长。上面介绍完如何将BPF程序hook到对应的函数上后，就要考虑如何从用户态去处理BPF获取到的数据了，这时候要用到我们的map，他的作用有两个，其一是存储我们采集的数据，其二是与用户态程序进行event的交互。这一节介绍用户态代码结构的组成。]]></description><category></category></item><item><title><![CDATA[代码随想录Day27]]></title><link>https://blog.youkuaiyun.com/gmail_82410/article/details/150074748</link><guid>https://blog.youkuaiyun.com/gmail_82410/article/details/150074748</guid><author>gmail_82410</author><pubDate>Fri, 08 Aug 2025 21:38:57 +0800</pubDate><description><![CDATA[提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档。]]></description><category></category></item><item><title><![CDATA[代码随想录Day26]]></title><link>https://blog.youkuaiyun.com/gmail_82410/article/details/150025342</link><guid>https://blog.youkuaiyun.com/gmail_82410/article/details/150025342</guid><author>gmail_82410</author><pubDate>Thu, 07 Aug 2025 22:43:24 +0800</pubDate><description><![CDATA[提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档。]]></description><category></category></item><item><title><![CDATA[代码随想录Day24]]></title><link>https://blog.youkuaiyun.com/gmail_82410/article/details/149947342</link><guid>https://blog.youkuaiyun.com/gmail_82410/article/details/149947342</guid><author>gmail_82410</author><pubDate>Thu, 07 Aug 2025 21:34:48 +0800</pubDate><description><![CDATA[提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档。]]></description><category></category></item><item><title><![CDATA[代码随想录Day23]]></title><link>https://blog.youkuaiyun.com/gmail_82410/article/details/149914522</link><guid>https://blog.youkuaiyun.com/gmail_82410/article/details/149914522</guid><author>gmail_82410</author><pubDate>Tue, 05 Aug 2025 21:18:26 +0800</pubDate><description><![CDATA[【代码】代码随想录Day23。]]></description><category></category></item><item><title><![CDATA[代码随想录Day22]]></title><link>https://blog.youkuaiyun.com/gmail_82410/article/details/149687809</link><guid>https://blog.youkuaiyun.com/gmail_82410/article/details/149687809</guid><author>gmail_82410</author><pubDate>Sun, 27 Jul 2025 13:00:00 +0800</pubDate><description><![CDATA[【代码】代码随想录Day22。]]></description><category></category></item><item><title><![CDATA[代码随想录Day21]]></title><link>https://blog.youkuaiyun.com/gmail_82410/article/details/149669908</link><guid>https://blog.youkuaiyun.com/gmail_82410/article/details/149669908</guid><author>gmail_82410</author><pubDate>Sat, 26 Jul 2025 18:39:10 +0800</pubDate><description><![CDATA[【代码】代码随想录Day21。]]></description><category></category></item><item><title><![CDATA[代码随想录Day19]]></title><link>https://blog.youkuaiyun.com/gmail_82410/article/details/149666235</link><guid>https://blog.youkuaiyun.com/gmail_82410/article/details/149666235</guid><author>gmail_82410</author><pubDate>Sat, 26 Jul 2025 17:12:47 +0800</pubDate><description><![CDATA[【代码】代码随想录Day19。]]></description><category></category></item><item><title><![CDATA[代码随想录Day18]]></title><link>https://blog.youkuaiyun.com/gmail_82410/article/details/149585602</link><guid>https://blog.youkuaiyun.com/gmail_82410/article/details/149585602</guid><author>gmail_82410</author><pubDate>Sat, 26 Jul 2025 12:52:46 +0800</pubDate><description><![CDATA[【代码】代码随想录Day18。]]></description><category></category></item><item><title><![CDATA[LeetCodeDay17]]></title><link>https://blog.youkuaiyun.com/gmail_82410/article/details/149550867</link><guid>https://blog.youkuaiyun.com/gmail_82410/article/details/149550867</guid><author>gmail_82410</author><pubDate>Wed, 23 Jul 2025 22:27:01 +0800</pubDate><description><![CDATA[【代码】LeetCodeDay17。]]></description><category></category></item><item><title><![CDATA[LeetCodeDay15二叉树]]></title><link>https://blog.youkuaiyun.com/gmail_82410/article/details/149309006</link><guid>https://blog.youkuaiyun.com/gmail_82410/article/details/149309006</guid><author>gmail_82410</author><pubDate>Wed, 23 Jul 2025 21:50:59 +0800</pubDate><description><![CDATA[提示：这里对文章进行总结：例如：以上就是今天要讲的内容，本文仅仅简单介绍了pandas的使用，而pandas提供了大量能使我们快速便捷地处理数据的函数和方法。]]></description><category></category></item><item><title><![CDATA[代码随想录Day16]]></title><link>https://blog.youkuaiyun.com/gmail_82410/article/details/149517740</link><guid>https://blog.youkuaiyun.com/gmail_82410/article/details/149517740</guid><author>gmail_82410</author><pubDate>Mon, 21 Jul 2025 23:11:16 +0800</pubDate><description><![CDATA[【代码】代码随想录Day16。]]></description><category></category></item><item><title><![CDATA[LeetCodeDay14二叉树]]></title><link>https://blog.youkuaiyun.com/gmail_82410/article/details/149308684</link><guid>https://blog.youkuaiyun.com/gmail_82410/article/details/149308684</guid><author>gmail_82410</author><pubDate>Sun, 13 Jul 2025 13:24:31 +0800</pubDate><description><![CDATA[提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档。]]></description><category></category></item><item><title><![CDATA[LeetCodeDay10]]></title><link>https://blog.youkuaiyun.com/gmail_82410/article/details/148979660</link><guid>https://blog.youkuaiyun.com/gmail_82410/article/details/148979660</guid><author>gmail_82410</author><pubDate>Sat, 28 Jun 2025 18:05:11 +0800</pubDate><description><![CDATA[提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档。]]></description><category></category></item><item><title><![CDATA[Day11 Leetcode刷题]]></title><link>https://blog.youkuaiyun.com/gmail_82410/article/details/148977377</link><guid>https://blog.youkuaiyun.com/gmail_82410/article/details/148977377</guid><author>gmail_82410</author><pubDate>Sat, 28 Jun 2025 17:52:14 +0800</pubDate><description><![CDATA[计算每个元素出现的times，放在pair中，通过sort与lambda的组合根据times进行排序，最后取前k个值作为结果。需要牢记sort与lambda的组合写法。用一个单调队列，每次插入元素的时候，自己与队列最前面一个数比较，保证第一个数字比自己大，这样在每个滑动窗口中，队列的第一个数字就是最大值。需要注意的是：用sscanf将字符串转化为整形，然后第一个数字怎么处理。]]></description><category></category></item><item><title><![CDATA[代码随想录跟刷Day8]]></title><link>https://blog.youkuaiyun.com/gmail_82410/article/details/148868850</link><guid>https://blog.youkuaiyun.com/gmail_82410/article/details/148868850</guid><author>gmail_82410</author><pubDate>Tue, 24 Jun 2025 12:49:32 +0800</pubDate><description><![CDATA[需要注意s.length()是unsigned int，无符号数，用s.length() - num去判断有可能导致数据溢出，需要避免。直接双指针交换就行了。]]></description><category></category></item><item><title><![CDATA[代码随想录跟刷Day7（哈希表）]]></title><link>https://blog.youkuaiyun.com/gmail_82410/article/details/148790247</link><guid>https://blog.youkuaiyun.com/gmail_82410/article/details/148790247</guid><author>gmail_82410</author><pubDate>Mon, 23 Jun 2025 13:35:03 +0800</pubDate><description><![CDATA[本题的难度在于去重，一开始没有注意到这部分，应该用一个do while循环在相加为0的情况，然后下一个原点的数值不能等于前一个原点。分成两组相加，用map查找key出现的次数。在三数相加的基础上再加一层for循环。]]></description><category></category></item><item><title><![CDATA[Android Java学习Day3 -蓝牙模块]]></title><link>https://blog.youkuaiyun.com/gmail_82410/article/details/148796399</link><guid>https://blog.youkuaiyun.com/gmail_82410/article/details/148796399</guid><author>gmail_82410</author><pubDate>Fri, 20 Jun 2025 18:01:27 +0800</pubDate><description><![CDATA[这是对onRequestPermissionsResult函数的重载，requestCode的判断语句用于判断是否来自当初的请求，通过比对参数BLUETOOTH_REQ判断，在requestPermissions处也使用了这个参数。后面是当初请求权限的列表，grantResult是针对每个权限请求的请求结果。]]></description><category></category></item><item><title><![CDATA[Python学习]]></title><link>https://blog.youkuaiyun.com/gmail_82410/article/details/148758937</link><guid>https://blog.youkuaiyun.com/gmail_82410/article/details/148758937</guid><author>gmail_82410</author><pubDate>Thu, 19 Jun 2025 14:55:19 +0800</pubDate><description><![CDATA[提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档。]]></description><category></category></item><item><title><![CDATA[代码随想录跟刷Day6.哈希表]]></title><link>https://blog.youkuaiyun.com/gmail_82410/article/details/148764117</link><guid>https://blog.youkuaiyun.com/gmail_82410/article/details/148764117</guid><author>gmail_82410</author><pubDate>Thu, 19 Jun 2025 13:57:34 +0800</pubDate><description><![CDATA[如果出现之前出现过的数字说明会进入无限循环，这是一个马尔科夫链，下一个状态只与本状态有关，检查这个马尔科夫链是不是环路即可。unordered_set也可以通过迭代器传递方法去遍历。]]></description><category></category></item></channel></rss>