<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[caodh172的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/caodh172</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; caodh172]]></copyright><item><title><![CDATA[书生·浦语大模型实战营（第一节课）]]></title><link>https://blog.youkuaiyun.com/caodh172/article/details/135374844</link><guid>https://blog.youkuaiyun.com/caodh172/article/details/135374844</guid><author>caodh172</author><pubDate>Wed, 03 Jan 2024 23:11:55 +0800</pubDate><description><![CDATA[主要是跟着视频了解书生·浦语全链条开源开放体系。]]></description><category></category></item><item><title><![CDATA[数据结构与算法]]></title><link>https://blog.youkuaiyun.com/caodh172/article/details/134771988</link><guid>https://blog.youkuaiyun.com/caodh172/article/details/134771988</guid><author>caodh172</author><pubDate>Sun, 03 Dec 2023 22:30:23 +0800</pubDate><description><![CDATA[这里可能没有什么稀奇的东西，各位看官随便看看就行，就是平常的一些刷题记录。]]></description><category></category></item><item><title><![CDATA[LeetCode-370.区间加法——差分方法]]></title><link>https://blog.youkuaiyun.com/caodh172/article/details/134771149</link><guid>https://blog.youkuaiyun.com/caodh172/article/details/134771149</guid><author>caodh172</author><pubDate>Sun, 03 Dec 2023 22:19:09 +0800</pubDate><description><![CDATA[假设你有一个长度为 n 的数组，初始情况下所有的数字均为 0，你将会被给出 k​​​​​​​ 个更新的操作。其中，每个操作会被表示为一个三元组：[startIndex, endIndex, inc]，你需要将子数组 A[startIndex … endIndex]（包括 startIndex 和 endIndex）增加 inc。请你返回 k 次操作后的数组。输入: length = 5, updates = [[1,3,2],[2,4,3],[0,2,-2]]输出: [-2,0,3,5,3]]]></description><category></category></item><item><title><![CDATA[「最新版」SpringBoot3.2.0官方教程实践00]]></title><link>https://blog.youkuaiyun.com/caodh172/article/details/134629750</link><guid>https://blog.youkuaiyun.com/caodh172/article/details/134629750</guid><author>caodh172</author><pubDate>Sun, 26 Nov 2023 16:50:31 +0800</pubDate><description><![CDATA[「最新版」SpringBoot3.2.0官方教程实践]]></description><category></category></item><item><title><![CDATA[「最新版」SpringBoot3.2.0官方教程实践01-构建一个RESTful Web服务]]></title><link>https://blog.youkuaiyun.com/caodh172/article/details/134628974</link><guid>https://blog.youkuaiyun.com/caodh172/article/details/134628974</guid><author>caodh172</author><pubDate>Sun, 26 Nov 2023 16:42:20 +0800</pubDate><description><![CDATA[构建一个服务，该服务将接受来自http://localhost:8080/greeting的HTTP GET请求。]]></description><category></category></item><item><title><![CDATA[Java多版本环境管理]]></title><link>https://blog.youkuaiyun.com/caodh172/article/details/134622276</link><guid>https://blog.youkuaiyun.com/caodh172/article/details/134622276</guid><author>caodh172</author><pubDate>Sat, 25 Nov 2023 23:36:47 +0800</pubDate><description><![CDATA[Java多版本环境管理]]></description><category></category></item><item><title><![CDATA[frp内网穿透（一击必中）]]></title><link>https://blog.youkuaiyun.com/caodh172/article/details/134403561</link><guid>https://blog.youkuaiyun.com/caodh172/article/details/134403561</guid><author>caodh172</author><pubDate>Tue, 14 Nov 2023 17:50:38 +0800</pubDate><description><![CDATA[不会失败的内网穿透攻略]]></description><category></category></item><item><title><![CDATA[天池-2023全球智能汽车AI挑战赛（1）]]></title><link>https://blog.youkuaiyun.com/caodh172/article/details/134389240</link><guid>https://blog.youkuaiyun.com/caodh172/article/details/134389240</guid><author>caodh172</author><pubDate>Tue, 14 Nov 2023 15:39:35 +0800</pubDate><description><![CDATA[天池-2023年全球智能汽车AI挑战赛第一次记录！]]></description><category></category></item><item><title><![CDATA[P1271 【深基9.例1】选举学生会计数排序]]></title><link>https://blog.youkuaiyun.com/caodh172/article/details/112830395</link><guid>https://blog.youkuaiyun.com/caodh172/article/details/112830395</guid><author>caodh172</author><pubDate>Tue, 19 Jan 2021 15:00:07 +0800</pubDate><description><![CDATA[P1271 【深基9.例1】选举学生会
感悟：这是一个不太难的题，用sort很快就能写出来，但是我却好多次都没通过。原因有两个。①粗心大意，根本读不清楚题。②上去就写代码，没有构思好。
不过这个题的最好解决方法是计数排序
计数排序是一个非基于比较的排序算法，该算法于1954年由 Harold H. Seward 
提出。它的优势在于在对一定范围内的整数排序时，它的复杂度为Ο(n+k)（其中k是
整数的范围），快于任何比较排序算法。 [1]  当然这是一种牺牲空间换取时间的做
法，而且当O(k)&gt;O(n]]></description><category></category></item><item><title><![CDATA[洛谷P1059 [NOIP2006 普及组] 明明的随机数]]></title><link>https://blog.youkuaiyun.com/caodh172/article/details/112724101</link><guid>https://blog.youkuaiyun.com/caodh172/article/details/112724101</guid><author>caodh172</author><pubDate>Sat, 16 Jan 2021 20:38:06 +0800</pubDate><description><![CDATA[/*题目描述
明明想在学校中请一些同学一起做一项问卷调查，为了实验的客观性，
他先用计算机生成了N个11到10001000之间的随机整数(N≤100)(N≤100)，
对于其中重复的数字，只保留一个，把其余相同的数去掉，不同的数对应着
不同的学生的学号。然后再把这些数从小到大排序，按照排好的顺序去找同
学做调查。请你协助明明完成“去重”与“排序”的工作。
输入格式
输入有两行，第1行为1个正整数，表示所生成的随机数的个数N
第2行有NN个用空格隔开的正整数，为所产生的随机数。
输出格式
输出也是两行，第1行]]></description><category></category></item><item><title><![CDATA[排序（起泡法排序）]]></title><link>https://blog.youkuaiyun.com/caodh172/article/details/104146494</link><guid>https://blog.youkuaiyun.com/caodh172/article/details/104146494</guid><author>caodh172</author><pubDate>Sun, 02 Feb 2020 16:54:18 +0800</pubDate><description><![CDATA[#include&lt;stdio.h&gt;
int main()
{
 int a[10];
 int i, j, t;
 printf("input 10 number:\n");
 for (i = 0; i &lt; 10; i++)
  scanf_s("%d", &amp;a[i]);
 printf("\n");
 for (j = 0; j &lt; 9; j++);
  for...]]></description><category></category></item></channel></rss>