<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[github_39019743的博客]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/github_39019743</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; github_39019743]]></copyright><item><title><![CDATA[AGENT-快速学习]]></title><link>https://blog.csdn.net/github_39019743/article/details/168347834</link><guid>https://blog.csdn.net/github_39019743/article/details/168347834</guid><author>github_39019743</author><pubDate>Mon, 19 Oct 2026 01:55:40 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[LLM-WIKI 测试 demo1]]></title><link>https://blog.csdn.net/github_39019743/article/details/161168279</link><guid>https://blog.csdn.net/github_39019743/article/details/161168279</guid><author>github_39019743</author><pubDate>Sun, 17 May 2026 16:58:10 +0800</pubDate><description><![CDATA[LLM-WIKI]]></description><category></category></item><item><title><![CDATA[阿里探花笔试]]></title><link>https://blog.csdn.net/github_39019743/article/details/144852700</link><guid>https://blog.csdn.net/github_39019743/article/details/144852700</guid><author>github_39019743</author><pubDate>Tue, 31 Dec 2024 16:16:05 +0800</pubDate><description><![CDATA[1，在A系统上统计各个系统login服务的调用次数 2，把统计出来的每个系统的调用次数做一次升序排序 提示：*/ //登录伪代码如下，各个系统调用本方法登录 // systemName系统名称、userId 用户ID //在本方法中把每个系统调用次数进行统计并用集合存储 public void login(String systemName,String userId) {]]></description><category></category></item><item><title><![CDATA[二叉树、平衡二叉树、红黑树、BTree、B+Tree的区别]]></title><link>https://blog.csdn.net/github_39019743/article/details/144531382</link><guid>https://blog.csdn.net/github_39019743/article/details/144531382</guid><author>github_39019743</author><pubDate>Tue, 17 Dec 2024 12:00:51 +0800</pubDate><description><![CDATA[二叉树、AVL树、B-true、B+True]]></description><category></category></item><item><title><![CDATA[根据不同类型。进入子类]]></title><link>https://blog.csdn.net/github_39019743/article/details/139667565</link><guid>https://blog.csdn.net/github_39019743/article/details/139667565</guid><author>github_39019743</author><pubDate>Fri, 14 Jun 2024 01:17:34 +0800</pubDate><description><![CDATA[【代码】根据不同类型。进入子类。]]></description><category></category></item><item><title><![CDATA[根据不同类型 父类进去子类]]></title><link>https://blog.csdn.net/github_39019743/article/details/139667534</link><guid>https://blog.csdn.net/github_39019743/article/details/139667534</guid><author>github_39019743</author><pubDate>Fri, 14 Jun 2024 01:10:48 +0800</pubDate><description><![CDATA[这个例子中，我们定义了一个基类Base和两个子类Sub1和Sub2。每个子类在构造时会把自己注册到Registry的静态map中，并提供了一个doSomething的实现。然后，我们可以通过Registry来获取对应类型的实例并调用它们的方法。这个例子展示了如何根据类型自动调用对应子类的方法，而无需手动判断类型并进行类型转换。假设有一个基类Base和几个继承自Base的子类Sub1、Sub2等，每个子类都会把自己的实例注入到一个静态的Map中。]]></description><category></category></item><item><title><![CDATA[根据类型跳转不同子类]]></title><link>https://blog.csdn.net/github_39019743/article/details/139667372</link><guid>https://blog.csdn.net/github_39019743/article/details/139667372</guid><author>github_39019743</author><pubDate>Fri, 14 Jun 2024 00:39:20 +0800</pubDate><description><![CDATA[【代码】根据类型跳转不同子类。]]></description><category></category></item><item><title><![CDATA[mysql 存储过程示例]]></title><link>https://blog.csdn.net/github_39019743/article/details/137029684</link><guid>https://blog.csdn.net/github_39019743/article/details/137029684</guid><author>github_39019743</author><pubDate>Mon, 25 Mar 2024 23:40:41 +0800</pubDate><description><![CDATA[Mysql创建存储过程]]></description><category></category></item><item><title><![CDATA[OD_2024_C卷_100分_64、整型数组按个位值排序【JAVA】【滑动窗口】]]></title><link>https://blog.csdn.net/github_39019743/article/details/136999686</link><guid>https://blog.csdn.net/github_39019743/article/details/136999686</guid><author>github_39019743</author><pubDate>Mon, 25 Mar 2024 00:47:53 +0800</pubDate><description><![CDATA[OD_2024_C卷_100分_64、整型数组按个位值排序【JAVA】【滑动窗口】]]></description><category></category></item><item><title><![CDATA[OD_2024_C卷_100分_66、整型数组按个位值排序【JAVA】]]></title><link>https://blog.csdn.net/github_39019743/article/details/136999652</link><guid>https://blog.csdn.net/github_39019743/article/details/136999652</guid><author>github_39019743</author><pubDate>Mon, 25 Mar 2024 00:44:07 +0800</pubDate><description><![CDATA[OD_2024_C卷_100分_66、整型数组按个位值排序【JAVA】]]></description><category></category></item><item><title><![CDATA[OD 分苹果]]></title><link>https://blog.csdn.net/github_39019743/article/details/135188999</link><guid>https://blog.csdn.net/github_39019743/article/details/135188999</guid><author>github_39019743</author><pubDate>Sun, 24 Dec 2023 23:29:46 +0800</pubDate><description><![CDATA[华为OD]]></description><category></category></item><item><title><![CDATA[OD 路灯照明问题]]></title><link>https://blog.csdn.net/github_39019743/article/details/135188959</link><guid>https://blog.csdn.net/github_39019743/article/details/135188959</guid><author>github_39019743</author><pubDate>Sun, 24 Dec 2023 23:26:02 +0800</pubDate><description><![CDATA[华为OD]]></description><category></category></item><item><title><![CDATA[OD 阿里巴巴找黄金宝箱]]></title><link>https://blog.csdn.net/github_39019743/article/details/135188885</link><guid>https://blog.csdn.net/github_39019743/article/details/135188885</guid><author>github_39019743</author><pubDate>Sun, 24 Dec 2023 23:20:39 +0800</pubDate><description><![CDATA[华为OD]]></description><category></category></item><item><title><![CDATA[OD 机房布局]]></title><link>https://blog.csdn.net/github_39019743/article/details/135188774</link><guid>https://blog.csdn.net/github_39019743/article/details/135188774</guid><author>github_39019743</author><pubDate>Sun, 24 Dec 2023 23:13:15 +0800</pubDate><description><![CDATA[【代码】OD 机房布局。]]></description><category></category></item><item><title><![CDATA[OD Linux发行版本]]></title><link>https://blog.csdn.net/github_39019743/article/details/135188740</link><guid>https://blog.csdn.net/github_39019743/article/details/135188740</guid><author>github_39019743</author><pubDate>Sun, 24 Dec 2023 23:09:18 +0800</pubDate><description><![CDATA[【代码】OD Linux发行版本。]]></description><category></category></item><item><title><![CDATA[OD 学校的位置]]></title><link>https://blog.csdn.net/github_39019743/article/details/135188695</link><guid>https://blog.csdn.net/github_39019743/article/details/135188695</guid><author>github_39019743</author><pubDate>Sun, 24 Dec 2023 23:05:16 +0800</pubDate><description><![CDATA[【代码】OD 学校的位置。]]></description><category></category></item><item><title><![CDATA[OD 投篮大赛]]></title><link>https://blog.csdn.net/github_39019743/article/details/135188644</link><guid>https://blog.csdn.net/github_39019743/article/details/135188644</guid><author>github_39019743</author><pubDate>Sun, 24 Dec 2023 23:02:25 +0800</pubDate><description><![CDATA[【代码】OD 投篮大赛。]]></description><category></category></item><item><title><![CDATA[OD 完美走位]]></title><link>https://blog.csdn.net/github_39019743/article/details/135188627</link><guid>https://blog.csdn.net/github_39019743/article/details/135188627</guid><author>github_39019743</author><pubDate>Sun, 24 Dec 2023 23:00:21 +0800</pubDate><description><![CDATA[【代码】OD 完美走位。]]></description><category></category></item><item><title><![CDATA[OD 完美走位]]></title><link>https://blog.csdn.net/github_39019743/article/details/135188523</link><guid>https://blog.csdn.net/github_39019743/article/details/135188523</guid><author>github_39019743</author><pubDate>Sun, 24 Dec 2023 22:50:54 +0800</pubDate><description><![CDATA[【代码】OD 完美走位。]]></description><category></category></item><item><title><![CDATA[OD java跳格子]]></title><link>https://blog.csdn.net/github_39019743/article/details/135188486</link><guid>https://blog.csdn.net/github_39019743/article/details/135188486</guid><author>github_39019743</author><pubDate>Sun, 24 Dec 2023 22:49:09 +0800</pubDate><description><![CDATA[华为OD]]></description><category></category></item></channel></rss>