<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[would20110710的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/would20110710</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; would20110710]]></copyright><item><title><![CDATA[C++编程小游戏------斗罗大陆（1）魂力测评和武魂觉醒(更改优化）]]></title><link>https://blog.youkuaiyun.com/would20110710/article/details/140432687</link><guid>https://blog.youkuaiyun.com/would20110710/article/details/140432687</guid><author>would20110710</author><pubDate>Mon, 15 Jul 2024 10:54:26 +0800</pubDate><description><![CDATA[相对于昨天的C++编程小游戏------斗罗大陆（1）魂力测评和武魂觉醒进行了改进和优化]]></description><category></category></item><item><title><![CDATA[C++编程小游戏------斗罗大陆（1）魂力测评和武魂觉醒]]></title><link>https://blog.youkuaiyun.com/would20110710/article/details/140411384</link><guid>https://blog.youkuaiyun.com/would20110710/article/details/140411384</guid><author>would20110710</author><pubDate>Sun, 14 Jul 2024 07:40:27 +0800</pubDate><description><![CDATA[C++编程小游戏------斗罗大陆（1）魂力测评和武魂觉醒]]></description><category></category></item><item><title><![CDATA[认识c++链表]]></title><link>https://blog.youkuaiyun.com/would20110710/article/details/137391320</link><guid>https://blog.youkuaiyun.com/would20110710/article/details/137391320</guid><author>would20110710</author><pubDate>Fri, 05 Apr 2024 08:12:56 +0800</pubDate><description><![CDATA[自定义类实现链表需要定义节点类和链表类，节点类包含一个值和一个指向下一个节点的指针，链表类包含头节点和相应的操作函数。链表由一系列节点组成，每个节点包含一个值和一个指向下一个节点的指针。双链表（Doubly Linked List）：每个节点有两个指针，一个指向前一个节点，一个指向后一个节点。链表的第一个节点称为头节点，最后一个节点称为尾节点，尾节点的指针指向空。链表的操作包括插入、删除、查找等。插入操作可以在链表的任何位置插入新节点，删除操作可以删除指定位置的节点，查找操作可以根据节点的值查找节点。]]></description><category></category></item><item><title><![CDATA[C++链表（上）]]></title><link>https://blog.youkuaiyun.com/would20110710/article/details/137167710</link><guid>https://blog.youkuaiyun.com/would20110710/article/details/137167710</guid><author>would20110710</author><pubDate>Sat, 30 Mar 2024 10:51:33 +0800</pubDate><description><![CDATA[从一个头节点（Head）开始，头节点作为链表的入口点，它包含了对第一个节点的引用。最后一个节点的指针指向一个空值（NULL），表示链表的结束。每一个节点分布在内存的不同位置，依靠指针关联起来。（只要有足够的内存空间，就能为链表分配内存）的优点（需要从头节点开始依次遍历，直到找到目标节点。，数据元素的逻辑顺序是通过链表中的指针链接次序实现的。（每个节点都需要存储指向下一个节点的指针）。链表在内存中的存储方式则是。]]></description><category></category></item><item><title><![CDATA[删除数组中的元素（单项运动链表）]]></title><link>https://blog.youkuaiyun.com/would20110710/article/details/137167518</link><guid>https://blog.youkuaiyun.com/would20110710/article/details/137167518</guid><author>would20110710</author><pubDate>Sat, 30 Mar 2024 10:33:00 +0800</pubDate><description><![CDATA[要删除的数是3，删除以后，链表中只剩14个元素：1 0 -3 5 6 8 10 22 -1 5 11 20 100 9。假定给出的整数序列为：1,3,3,0,-3,5,6,8,3,10,22,-1,3,5,11,20,100,3,9,3。每个整数之间用空格分隔；程序中必须有链表的相关操作：建立链表，删除元素，输出删除后链表中元素，释放链表。将数组内所有待删除元素删除以后，输出数组内的剩余元素的值，每个整数之间用空格分隔。第三行是一个整数k，代表待删除元素的值（k的取值也在32位有符号整数范围内）。]]></description><category></category></item><item><title><![CDATA[统计学生信息(双项运动链表）]]></title><link>https://blog.youkuaiyun.com/would20110710/article/details/137167413</link><guid>https://blog.youkuaiyun.com/would20110710/article/details/137167413</guid><author>would20110710</author><pubDate>Sat, 30 Mar 2024 10:29:56 +0800</pubDate><description><![CDATA[统计学生信息(双项运动链表）]]></description><category></category></item><item><title><![CDATA[C++操纵数组]]></title><link>https://blog.youkuaiyun.com/would20110710/article/details/134611761</link><guid>https://blog.youkuaiyun.com/would20110710/article/details/134611761</guid><author>would20110710</author><pubDate>Sat, 25 Nov 2023 10:51:02 +0800</pubDate><description><![CDATA[藤藤有一个长度为n的数组a现在藤藤希望改变这个数组，使得该数组的最小值尽可能的大。现在藤藤可以施展m次魔法，每次魔法可以使得连续长度为L的一段每个元素+1。藤藤想知道最终这个数组的最小值最大可以达到多少？]]></description><category></category></item><item><title><![CDATA[超级彩票机]]></title><link>https://blog.youkuaiyun.com/would20110710/article/details/134216210</link><guid>https://blog.youkuaiyun.com/would20110710/article/details/134216210</guid><author>would20110710</author><pubDate>Sat, 04 Nov 2023 11:34:06 +0800</pubDate><description><![CDATA[【代码】超级彩票机。]]></description><category></category></item><item><title><![CDATA[询问（请进）]]></title><link>https://blog.youkuaiyun.com/would20110710/article/details/134215724</link><guid>https://blog.youkuaiyun.com/would20110710/article/details/134215724</guid><author>would20110710</author><pubDate>Sat, 04 Nov 2023 10:59:15 +0800</pubDate><description><![CDATA[你们对什么感兴趣你们对什么感兴趣。]]></description><category></category></item><item><title><![CDATA[C++分治算法------ 砍树]]></title><link>https://blog.youkuaiyun.com/would20110710/article/details/134214717</link><guid>https://blog.youkuaiyun.com/would20110710/article/details/134214717</guid><author>would20110710</author><pubDate>Sat, 04 Nov 2023 09:51:23 +0800</pubDate><description><![CDATA[伐木工人Mirko需要砍M米长的木材。对Mirko只被允许砍伐一排树。MirkoMirko设置一个高度参数H（米），伐木机升起一个巨大的锯片到高度H，并锯掉所有树比 高H的部分（当然，树木不高于H 米的部分保持不变）。Mirko就得到树木被锯下的部分。例如，如果一排树的高度分别为20,15,10和17，Mirko把锯片升到15米的高度，切割后树木剩下的高度将是 15,15,10 和15，而Mirko将从第1棵树得到5米，从第4棵树得到2米，共得到7米木材。Mirko。]]></description><category></category></item><item><title><![CDATA[C++分治算法-------木材加工]]></title><link>https://blog.youkuaiyun.com/would20110710/article/details/134214430</link><guid>https://blog.youkuaiyun.com/would20110710/article/details/134214430</guid><author>would20110710</author><pubDate>Sat, 04 Nov 2023 09:22:02 +0800</pubDate><description><![CDATA[木材厂有n根原木，现在想把这些木头切割成 k 段长度均为 l 的小段木头（木头有可能有剩余）。当然，我们希望得到的小段木头越长越好，请求出的最大值。木头长度的单位是cm，原木的长度都是正整数，我们要求切割得到的小段木头的长度也是正整数。例如有两根原木长度分别为11和21，要求切割成等长的6段，很明显能切割出来的小段木头长度最长为5。]]></description><category></category></item><item><title><![CDATA[C++编程题目------平面上的最接近点对(分治算法)]]></title><link>https://blog.youkuaiyun.com/would20110710/article/details/134087767</link><guid>https://blog.youkuaiyun.com/would20110710/article/details/134087767</guid><author>would20110710</author><pubDate>Sat, 28 Oct 2023 10:02:53 +0800</pubDate><description><![CDATA[给定平面上n个点，找出其中的一对点的距离，使得在这n个点的所有点对中，该距离为所有点对中最小的。]]></description><category></category></item><item><title><![CDATA[Scratch游戏------打砖块（不用VIP）]]></title><link>https://blog.youkuaiyun.com/would20110710/article/details/132943520</link><guid>https://blog.youkuaiyun.com/would20110710/article/details/132943520</guid><author>would20110710</author><pubDate>Sun, 17 Sep 2023 16:10:21 +0800</pubDate><description><![CDATA[打砖块游戏是一款较老的动作电子游戏。玩家操作“挡板”，让一颗不断弹来弹去的“球”击碎砖块，作为过关目标消去的“砖块”且的途中不会落到屏幕底下。点击小绿旗，游戏开始，挡板随鼠标移动，按空格键小球发射，击碎所有砖块为胜，小球死亡3次为输（即小球碰到底部）。快来一起做吧！！！]]></description><category></category></item><item><title><![CDATA[C++即C语言资源（3）]]></title><link>https://blog.youkuaiyun.com/would20110710/article/details/132342030</link><guid>https://blog.youkuaiyun.com/would20110710/article/details/132342030</guid><author>would20110710</author><pubDate>Thu, 17 Aug 2023 15:25:15 +0800</pubDate><description><![CDATA[以上是我为大家准备的资源，机会难得，赶紧点进去看看吧，粉丝可看完整版。]]></description><category></category></item><item><title><![CDATA[C++即C语言资源（1）]]></title><link>https://blog.youkuaiyun.com/would20110710/article/details/132341976</link><guid>https://blog.youkuaiyun.com/would20110710/article/details/132341976</guid><author>would20110710</author><pubDate>Thu, 17 Aug 2023 15:23:28 +0800</pubDate><description><![CDATA[以上是我为大家准备的资源，机会难得，赶紧点进去看看吧，粉丝可看完整版。]]></description><category></category></item><item><title><![CDATA[C++即C语言资源（2）]]></title><link>https://blog.youkuaiyun.com/would20110710/article/details/132341940</link><guid>https://blog.youkuaiyun.com/would20110710/article/details/132341940</guid><author>would20110710</author><pubDate>Thu, 17 Aug 2023 15:22:25 +0800</pubDate><description><![CDATA[上是我为大家准备的资源，机会难得，赶紧点进去看看吧，粉丝可看完整版。]]></description><category></category></item><item><title><![CDATA[C++即C语言资源（4）]]></title><link>https://blog.youkuaiyun.com/would20110710/article/details/132341903</link><guid>https://blog.youkuaiyun.com/would20110710/article/details/132341903</guid><author>would20110710</author><pubDate>Thu, 17 Aug 2023 15:21:21 +0800</pubDate><description><![CDATA[以上是我为大家准备的资源，机会难得，赶紧点进去看看吧，粉丝可看完整版。]]></description><category></category></item><item><title><![CDATA[C++即C语言资源（5）]]></title><link>https://blog.youkuaiyun.com/would20110710/article/details/132341879</link><guid>https://blog.youkuaiyun.com/would20110710/article/details/132341879</guid><author>would20110710</author><pubDate>Thu, 17 Aug 2023 15:20:19 +0800</pubDate><description><![CDATA[以上是我为大家准备的资源，机会难得，赶紧点进去看看吧，粉丝可看完整版。]]></description><category></category></item><item><title><![CDATA[C++即C语言资源（6）]]></title><link>https://blog.youkuaiyun.com/would20110710/article/details/132341833</link><guid>https://blog.youkuaiyun.com/would20110710/article/details/132341833</guid><author>would20110710</author><pubDate>Thu, 17 Aug 2023 15:18:49 +0800</pubDate><description><![CDATA[以上是我为大家准备的资源，机会难得，赶紧点进去看看吧。]]></description><category></category></item><item><title><![CDATA[C++即C语言资源（7）]]></title><link>https://blog.youkuaiyun.com/would20110710/article/details/132341792</link><guid>https://blog.youkuaiyun.com/would20110710/article/details/132341792</guid><author>would20110710</author><pubDate>Thu, 17 Aug 2023 15:17:40 +0800</pubDate><description><![CDATA[以上是我为大家准备的资源，机会难得，赶紧点进去看看吧。]]></description><category></category></item></channel></rss>