<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[多言数穷，不如守中。十语九中，未必称奇；一语未中，愆尤骈集。]]></title><description><![CDATA[happy coding]]></description><link>https://blog.youkuaiyun.com/avenccssddnn</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; avenccssddnn]]></copyright><item><title><![CDATA[【数学题】包含⚪圆圈的三角形一共有多少个]]></title><link>https://blog.youkuaiyun.com/avenccssddnn/article/details/156658711</link><guid>https://blog.youkuaiyun.com/avenccssddnn/article/details/156658711</guid><author>avenccssddnn</author><pubDate>Tue, 06 Jan 2026 23:16:33 +0800</pubDate><description><![CDATA[摘要：本文通过两个几何问题探讨了包含特定图形的计数方法。第一个问题计算包含圆圈的三角形数量，通过确定底部两点在左右两侧的分布（2×3=6个）。第二个问题类似地计算包含圆圈的长方形数量，通过确定对角顶点的可能组合（4×16=64个）。解题关键在于识别决定图形位置的关键点组合，采用乘法原理快速求解。]]></description><category></category></item><item><title><![CDATA[【数学题】最少的砝码个数可称重整数克 1-121]]></title><link>https://blog.youkuaiyun.com/avenccssddnn/article/details/156548283</link><guid>https://blog.youkuaiyun.com/avenccssddnn/article/details/156548283</guid><author>avenccssddnn</author><pubDate>Sun, 04 Jan 2026 00:11:30 +0800</pubDate><description><![CDATA[最少需要5个砝码，重量分别为1克、3克、9克、27克和81克。这些砝码通过组合可以称出1-121克之间的所有整数克重量。这个解决方案基于三进制思想，每个新砝码的重量都是前几个砝码总重量的2倍加1，这样能最大化称重范围。具体来说，5个砝码的总重量为121克，恰好覆盖题目要求的称重范围。]]></description><category></category></item><item><title><![CDATA[【平面几何】判断一个点是否在任意多边形的内部]]></title><link>https://blog.youkuaiyun.com/avenccssddnn/article/details/156519839</link><guid>https://blog.youkuaiyun.com/avenccssddnn/article/details/156519839</guid><author>avenccssddnn</author><pubDate>Fri, 02 Jan 2026 23:46:53 +0800</pubDate><description><![CDATA[摘要：本文介绍了判断一个点是否在任意多边形内部的算法。与判断点在圆内的方法不同，对于不规则多边形，可以通过从该点画一条水平或垂直线，统计其与多边形边的交点数量。若交点数为奇数，则点在多边形内部；若为偶数，则在外部。这种方法简单有效地解决了点在复杂多边形内的判定问题。]]></description><category></category></item><item><title><![CDATA[【JavaScript】常见排序算法实现]]></title><link>https://blog.youkuaiyun.com/avenccssddnn/article/details/156492489</link><guid>https://blog.youkuaiyun.com/avenccssddnn/article/details/156492489</guid><author>avenccssddnn</author><pubDate>Thu, 01 Jan 2026 23:23:45 +0800</pubDate><description><![CDATA[本文介绍了五种经典排序算法的JavaScript实现。冒泡排序通过相邻元素比较交换实现排序（O(N²)）；选择排序每次选择最小元素交换位置（O(N²)）；插入排序将无序元素插入有序部分（O(N²)）；归并排序采用分治策略递归排序后合并（O(N log N)）；快速排序通过分区函数确定轴值位置并递归处理（平均O(N log N)）。每种算法均附有实现代码和思路说明。]]></description><category></category></item><item><title><![CDATA[C站算法技能题-题解(javascript)]]></title><link>https://blog.youkuaiyun.com/avenccssddnn/article/details/146436914</link><guid>https://blog.youkuaiyun.com/avenccssddnn/article/details/146436914</guid><author>avenccssddnn</author><pubDate>Sat, 22 Mar 2025 11:29:24 +0800</pubDate><description><![CDATA[【代码】C站算法技能题-题解(javascript)]]></description><category></category></item><item><title><![CDATA[How Spark Read Sftp Files from Hadoop SFTP FileSystem]]></title><link>https://blog.youkuaiyun.com/avenccssddnn/article/details/146282406</link><guid>https://blog.youkuaiyun.com/avenccssddnn/article/details/146282406</guid><author>avenccssddnn</author><pubDate>Sat, 15 Mar 2025 17:30:02 +0800</pubDate><description><![CDATA[【代码】How Spark Read Sftp Files from Hadoop SFTP FileSystem。]]></description><category></category></item><item><title><![CDATA[Minikube+HyperV 踩坑记]]></title><link>https://blog.youkuaiyun.com/avenccssddnn/article/details/146040146</link><guid>https://blog.youkuaiyun.com/avenccssddnn/article/details/146040146</guid><author>avenccssddnn</author><pubDate>Wed, 05 Mar 2025 12:40:09 +0800</pubDate><description><![CDATA[当前可用加速镜像参考软件镜像。]]></description><category></category></item><item><title><![CDATA[【HDU】2014 青年歌手大奖赛_评委会打分]]></title><link>https://blog.youkuaiyun.com/avenccssddnn/article/details/145270882</link><guid>https://blog.youkuaiyun.com/avenccssddnn/article/details/145270882</guid><author>avenccssddnn</author><pubDate>Wed, 29 Jan 2025 01:00:00 +0800</pubDate><description><![CDATA[【代码】【HDU】2014 青年歌手大奖赛_评委会打分。]]></description><category></category></item><item><title><![CDATA[【HDU】2096 小明A+B]]></title><link>https://blog.youkuaiyun.com/avenccssddnn/article/details/145270975</link><guid>https://blog.youkuaiyun.com/avenccssddnn/article/details/145270975</guid><author>avenccssddnn</author><pubDate>Tue, 28 Jan 2025 09:00:00 +0800</pubDate><description><![CDATA[【代码】【HDU】2096 小明A+B。]]></description><category></category></item><item><title><![CDATA[【HDU】2013 蟠桃记]]></title><link>https://blog.youkuaiyun.com/avenccssddnn/article/details/145270910</link><guid>https://blog.youkuaiyun.com/avenccssddnn/article/details/145270910</guid><author>avenccssddnn</author><pubDate>Mon, 27 Jan 2025 10:30:00 +0800</pubDate><description><![CDATA[【代码】【HDU】2013 蟠桃记。]]></description><category></category></item><item><title><![CDATA[【HDU】2011 多项式求和]]></title><link>https://blog.youkuaiyun.com/avenccssddnn/article/details/145270836</link><guid>https://blog.youkuaiyun.com/avenccssddnn/article/details/145270836</guid><author>avenccssddnn</author><pubDate>Sun, 26 Jan 2025 09:00:00 +0800</pubDate><description><![CDATA[【代码】【HDU】2011 多项式求和。]]></description><category></category></item><item><title><![CDATA[【HDU】2010 水仙花数]]></title><link>https://blog.youkuaiyun.com/avenccssddnn/article/details/145248876</link><guid>https://blog.youkuaiyun.com/avenccssddnn/article/details/145248876</guid><author>avenccssddnn</author><pubDate>Sat, 25 Jan 2025 10:30:00 +0800</pubDate><description><![CDATA[【代码】【HDU】2010 水仙花数。]]></description><category></category></item><item><title><![CDATA[【HDU】2009 求数列的和]]></title><link>https://blog.youkuaiyun.com/avenccssddnn/article/details/145235194</link><guid>https://blog.youkuaiyun.com/avenccssddnn/article/details/145235194</guid><author>avenccssddnn</author><pubDate>Fri, 24 Jan 2025 08:45:00 +0800</pubDate><description><![CDATA[【代码】【HDU】2009 求数列的和。]]></description><category></category></item><item><title><![CDATA[【HDU】2008 数值统计]]></title><link>https://blog.youkuaiyun.com/avenccssddnn/article/details/145234265</link><guid>https://blog.youkuaiyun.com/avenccssddnn/article/details/145234265</guid><author>avenccssddnn</author><pubDate>Thu, 23 Jan 2025 08:45:00 +0800</pubDate><description><![CDATA[【代码】【HDU】2008 数值统计。]]></description><category></category></item><item><title><![CDATA[【HDU】2029 Palindromes _easy version]]></title><link>https://blog.youkuaiyun.com/avenccssddnn/article/details/145270945</link><guid>https://blog.youkuaiyun.com/avenccssddnn/article/details/145270945</guid><author>avenccssddnn</author><pubDate>Thu, 23 Jan 2025 01:10:50 +0800</pubDate><description><![CDATA[【代码】【HDU】2029 Palindromes _easy version。]]></description><category></category></item><item><title><![CDATA[【HDU】2007 平方和与立方和]]></title><link>https://blog.youkuaiyun.com/avenccssddnn/article/details/145234124</link><guid>https://blog.youkuaiyun.com/avenccssddnn/article/details/145234124</guid><author>avenccssddnn</author><pubDate>Wed, 22 Jan 2025 08:45:00 +0800</pubDate><description><![CDATA[【代码】【HDU】2007 平方和与立方和。]]></description><category></category></item><item><title><![CDATA[【HDU】2006 求奇数的乘积]]></title><link>https://blog.youkuaiyun.com/avenccssddnn/article/details/145232321</link><guid>https://blog.youkuaiyun.com/avenccssddnn/article/details/145232321</guid><author>avenccssddnn</author><pubDate>Tue, 21 Jan 2025 08:45:00 +0800</pubDate><description><![CDATA[【代码】【HDU】2006 求奇数的乘积。]]></description><category></category></item><item><title><![CDATA[【HDU】2012 素数判定]]></title><link>https://blog.youkuaiyun.com/avenccssddnn/article/details/145270867</link><guid>https://blog.youkuaiyun.com/avenccssddnn/article/details/145270867</guid><author>avenccssddnn</author><pubDate>Tue, 21 Jan 2025 08:29:23 +0800</pubDate><description><![CDATA[【代码】【HDU】2012 素数判定。]]></description><category></category></item><item><title><![CDATA[【HDU】2004 成绩转换]]></title><link>https://blog.youkuaiyun.com/avenccssddnn/article/details/145216658</link><guid>https://blog.youkuaiyun.com/avenccssddnn/article/details/145216658</guid><author>avenccssddnn</author><pubDate>Mon, 20 Jan 2025 08:45:00 +0800</pubDate><description><![CDATA[【代码】【HDU】2004 成绩转换。]]></description><category></category></item><item><title><![CDATA[【HDU】2003 求绝对值]]></title><link>https://blog.youkuaiyun.com/avenccssddnn/article/details/145216570</link><guid>https://blog.youkuaiyun.com/avenccssddnn/article/details/145216570</guid><author>avenccssddnn</author><pubDate>Sun, 19 Jan 2025 11:00:00 +0800</pubDate><description><![CDATA[【代码】【HDU】2003 求绝对值。]]></description><category></category></item></channel></rss>