<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[a1141311的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/a1141311</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; a1141311]]></copyright><item><title><![CDATA[食物分类问题]]></title><link>https://blog.youkuaiyun.com/a1141311/article/details/146129224</link><guid>https://blog.youkuaiyun.com/a1141311/article/details/146129224</guid><author>a1141311</author><pubDate>Sun, 09 Mar 2025 15:20:31 +0800</pubDate><description><![CDATA[现在有11类食物，有训练集和测试集，其中训练集中有带标签的数据和不带标签的数据。]]></description><category></category></item><item><title><![CDATA[C++字符串相关操作]]></title><link>https://blog.youkuaiyun.com/a1141311/article/details/146115639</link><guid>https://blog.youkuaiyun.com/a1141311/article/details/146115639</guid><author>a1141311</author><pubDate>Sat, 08 Mar 2025 16:00:57 +0800</pubDate><description><![CDATA[建议先看着代码自己想一下输出结果，再和运行结果比较一下。]]></description><category></category></item><item><title><![CDATA[二分查找C++实现]]></title><link>https://blog.youkuaiyun.com/a1141311/article/details/146115152</link><guid>https://blog.youkuaiyun.com/a1141311/article/details/146115152</guid><author>a1141311</author><pubDate>Sat, 08 Mar 2025 13:39:18 +0800</pubDate><description><![CDATA[二分查找是一种在有序数组中查找特定元素的高效算法，其核心思想是通过分治法逐步缩小搜索范围，直到找到目标值或确定目标值不存在。]]></description><category></category></item><item><title><![CDATA[归并算法的C++实现]]></title><link>https://blog.youkuaiyun.com/a1141311/article/details/146114763</link><guid>https://blog.youkuaiyun.com/a1141311/article/details/146114763</guid><author>a1141311</author><pubDate>Sat, 08 Mar 2025 13:24:07 +0800</pubDate><description><![CDATA[归并算法的核心思想是将一个未排序的数组分成两个子数组，分别对子数组进行排序，然后将两个有序的子数组合并成一个有序的数组。]]></description><category></category></item><item><title><![CDATA[选择排序C++实现]]></title><link>https://blog.youkuaiyun.com/a1141311/article/details/146114690</link><guid>https://blog.youkuaiyun.com/a1141311/article/details/146114690</guid><author>a1141311</author><pubDate>Sat, 08 Mar 2025 13:05:04 +0800</pubDate><description><![CDATA[选择排序的核心思想是通过不断选择未排序部分中的最小（或最大）元素，将其放到已排序部分的末尾，直到所有元素都排序完成。]]></description><category></category></item><item><title><![CDATA[插入排序C++实现]]></title><link>https://blog.youkuaiyun.com/a1141311/article/details/146113253</link><guid>https://blog.youkuaiyun.com/a1141311/article/details/146113253</guid><author>a1141311</author><pubDate>Sat, 08 Mar 2025 11:32:48 +0800</pubDate><description><![CDATA[插入排序是一种简单直观的排序算法，其核心思想是通过构建有序序列，逐步将未排序的序列插入到已排序的正确位置。]]></description><category></category></item><item><title><![CDATA[两数相加C++]]></title><link>https://blog.youkuaiyun.com/a1141311/article/details/146111998</link><guid>https://blog.youkuaiyun.com/a1141311/article/details/146111998</guid><author>a1141311</author><pubDate>Sat, 08 Mar 2025 10:25:27 +0800</pubDate><description><![CDATA[给你两个的链表，表示两个非负的整数。它们每位数字都是按照的方式存储的，并且每个节点只能存储数字。请你将两个数相加，并以相同形式返回一个表示和的链表。你可以假设除了数字 0 之外，这两个数都不会以 0 开头。]]></description><category></category></item><item><title><![CDATA[新冠病毒感染人数预测]]></title><link>https://blog.youkuaiyun.com/a1141311/article/details/146077497</link><guid>https://blog.youkuaiyun.com/a1141311/article/details/146077497</guid><author>a1141311</author><pubDate>Fri, 07 Mar 2025 01:02:30 +0800</pubDate><description><![CDATA[在运行的时候报出了这个错然后去网上搜了一下，发现是因为标题有中文的原因加入上面的代码就可以解决报错问题了。]]></description><category></category></item><item><title><![CDATA[线性回归训练]]></title><link>https://blog.youkuaiyun.com/a1141311/article/details/146050822</link><guid>https://blog.youkuaiyun.com/a1141311/article/details/146050822</guid><author>a1141311</author><pubDate>Wed, 05 Mar 2025 20:53:44 +0800</pubDate><description><![CDATA[一个关于线性回归的训练]]></description><category></category></item><item><title><![CDATA[A除以B（PTA乙级）]]></title><link>https://blog.youkuaiyun.com/a1141311/article/details/127989656</link><guid>https://blog.youkuaiyun.com/a1141311/article/details/127989656</guid><author>a1141311</author><pubDate>Tue, 22 Nov 2022 20:41:08 +0800</pubDate><description><![CDATA[本题要求计算 A/B，其中 A 是不超过 1000 位的正整数，B 是 1 位正整数。你需要输出商数 Q 和余数 R，使得 A=B×Q+R 成立。]]></description><category></category></item><item><title><![CDATA[德才论（PTA乙级）]]></title><link>https://blog.youkuaiyun.com/a1141311/article/details/127988918</link><guid>https://blog.youkuaiyun.com/a1141311/article/details/127988918</guid><author>a1141311</author><pubDate>Tue, 22 Nov 2022 19:58:14 +0800</pubDate><description><![CDATA[宋代史学家司马光在《资治通鉴》中有一段著名的“德才论”：“是故才德全尽谓之圣人，才德兼亡谓之愚人，德胜才谓之君子，才胜德谓之小人。凡取人之术，苟不得圣人，君子而与之，与其得小人，不若得愚人。”现给出一批考生的德才分数，请根据司马光的理论给出录取排名。]]></description><category></category></item></channel></rss>