<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>瀚可 Hank · 个人网站</title><description>瀚可的个人网站 — 博客、项目、研究与套磁信归档。</description><link>https://hankzhangcn.github.io/</link><item><title>久违、干扰与坚持不懈</title><link>https://hankzhangcn.github.io/writing/2021/08/%E4%B9%85%E8%BF%9D-%E5%B9%B2%E6%89%B0%E4%B8%8E%E5%9D%9A%E6%8C%81%E4%B8%8D%E6%87%88/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2021/08/%E4%B9%85%E8%BF%9D-%E5%B9%B2%E6%89%B0%E4%B8%8E%E5%9D%9A%E6%8C%81%E4%B8%8D%E6%87%88/</guid><description>久违、干扰与坚持不懈</description><pubDate>Wed, 11 Aug 2021 00:00:00 GMT</pubDate></item><item><title>写在入门之前</title><link>https://hankzhangcn.github.io/writing/2021/01/%E5%86%99%E5%9C%A8%E5%85%A5%E9%97%A8%E4%B9%8B%E5%89%8D/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2021/01/%E5%86%99%E5%9C%A8%E5%85%A5%E9%97%A8%E4%B9%8B%E5%89%8D/</guid><description>学无止境。</description><pubDate>Tue, 26 Jan 2021 00:00:00 GMT</pubDate></item><item><title>建立你的个人数据库</title><link>https://hankzhangcn.github.io/writing/2021/01/%E5%BB%BA%E7%AB%8B%E4%BD%A0%E7%9A%84%E4%B8%AA%E4%BA%BA%E6%95%B0%E6%8D%AE%E5%BA%93/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2021/01/%E5%BB%BA%E7%AB%8B%E4%BD%A0%E7%9A%84%E4%B8%AA%E4%BA%BA%E6%95%B0%E6%8D%AE%E5%BA%93/</guid><description>建立你的个人数据库</description><pubDate>Tue, 26 Jan 2021 00:00:00 GMT</pubDate></item><item><title>音乐回忆 2020</title><link>https://hankzhangcn.github.io/writing/2020/01/%E9%9F%B3%E4%B9%90%E5%9B%9E%E5%BF%86-2020/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2020/01/%E9%9F%B3%E4%B9%90%E5%9B%9E%E5%BF%86-2020/</guid><description>简简单单的一些歌。</description><pubDate>Wed, 01 Jan 2020 00:00:00 GMT</pubDate></item><item><title>凸包问题</title><link>https://hankzhangcn.github.io/writing/2020/12/%E5%87%B8%E5%8C%85%E9%97%AE%E9%A2%98/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2020/12/%E5%87%B8%E5%8C%85%E9%97%AE%E9%A2%98/</guid><description>Algorithm的课设大作业：计算几何中的凸包问题。本文基于JavaScript和C语言，使用Divide &amp; Conquer方法和Bruce Force方法，以及Stepping步进法分别对此问题进行了回答。</description><pubDate>Wed, 23 Dec 2020 00:00:00 GMT</pubDate></item><item><title>递归是什么</title><link>https://hankzhangcn.github.io/writing/2020/12/%E5%A6%82%E4%BD%95%E7%90%86%E8%A7%A3%E6%B1%89%E8%AF%BA%E5%A1%94%E7%9A%84%E9%80%92%E5%BD%92/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2020/12/%E5%A6%82%E4%BD%95%E7%90%86%E8%A7%A3%E6%B1%89%E8%AF%BA%E5%A1%94%E7%9A%84%E9%80%92%E5%BD%92/</guid><description>递归是什么</description><pubDate>Sun, 20 Dec 2020 00:00:00 GMT</pubDate></item><item><title>算法设计与分析-总结</title><link>https://hankzhangcn.github.io/writing/2020/12/%E7%AE%97%E6%B3%95%E8%AE%BE%E8%AE%A1%E4%B8%8E%E5%88%86%E6%9E%90-%E9%87%8D%E7%82%B9%E7%AC%94%E8%AE%B0/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2020/12/%E7%AE%97%E6%B3%95%E8%AE%BE%E8%AE%A1%E4%B8%8E%E5%88%86%E6%9E%90-%E9%87%8D%E7%82%B9%E7%AC%94%E8%AE%B0/</guid><description>蒟蒻总结的算法考查课，只是开卷笔记而已，但事实上在考场上用处为零。</description><pubDate>Thu, 03 Dec 2020 00:00:00 GMT</pubDate></item><item><title>UML导图</title><link>https://hankzhangcn.github.io/writing/2020/12/uml%E5%AF%BC%E5%9B%BE/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2020/12/uml%E5%AF%BC%E5%9B%BE/</guid><description>UML体系真的很复杂，还是需要一张导图来梳理思路的。</description><pubDate>Fri, 18 Dec 2020 00:00:00 GMT</pubDate></item><item><title>分支限界法解0-1背包问题——基于JavaScript</title><link>https://hankzhangcn.github.io/writing/2020/12/0-1%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E7%9A%84%E5%88%86%E6%94%AF%E9%99%90%E7%95%8C%E8%A7%A3%E6%B3%95/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2020/12/0-1%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E7%9A%84%E5%88%86%E6%94%AF%E9%99%90%E7%95%8C%E8%A7%A3%E6%B3%95/</guid><description>算法课程的第六次实验。 使用JavaScript实现了分支限界法较好地解决0-1背包的问题。</description><pubDate>Sat, 05 Dec 2020 00:00:00 GMT</pubDate></item><item><title>回溯法解0-1背包问题——基于JavaScript</title><link>https://hankzhangcn.github.io/writing/2020/12/0-1%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E7%9A%84%E5%9B%9E%E6%BA%AF%E8%A7%A3%E6%B3%95/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2020/12/0-1%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E7%9A%84%E5%9B%9E%E6%BA%AF%E8%A7%A3%E6%B3%95/</guid><description>算法课程的第五次实验。 使用JavaScript实现了回溯法解决0-1背包的问题。 由于JS不是很熟练，代码非常粗糙。</description><pubDate>Tue, 01 Dec 2020 00:00:00 GMT</pubDate></item><item><title>贪心法解背包问题——基于JavaScript</title><link>https://hankzhangcn.github.io/writing/2020/12/%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E7%9A%84%E8%B4%AA%E5%BF%83%E8%A7%A3%E6%B3%95/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2020/12/%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E7%9A%84%E8%B4%AA%E5%BF%83%E8%A7%A3%E6%B3%95/</guid><description>算法实验中衍生的程序。 利用贪心原则取高重价比，在JS上实现较为简单。</description><pubDate>Tue, 01 Dec 2020 00:00:00 GMT</pubDate></item><item><title>回望的是什么——2020年11月闪回</title><link>https://hankzhangcn.github.io/writing/2020/11/%E5%9B%9E%E6%9C%9B%E7%9A%84%E6%98%AF%E4%BB%80%E4%B9%88-2020%E5%B9%B411%E6%9C%88%E9%97%AA%E5%9B%9E/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2020/11/%E5%9B%9E%E6%9C%9B%E7%9A%84%E6%98%AF%E4%BB%80%E4%B9%88-2020%E5%B9%B411%E6%9C%88%E9%97%AA%E5%9B%9E/</guid><description>一篇闪回，还有一些思考。</description><pubDate>Mon, 30 Nov 2020 00:00:00 GMT</pubDate></item><item><title>硬币问题</title><link>https://hankzhangcn.github.io/writing/2020/11/%E7%A1%AC%E5%B8%81%E9%97%AE%E9%A2%98/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2020/11/%E7%A1%AC%E5%B8%81%E9%97%AE%E9%A2%98/</guid><description>算法课程的第四次实验，实际是动态规划和贪心法的对比。</description><pubDate>Sun, 22 Nov 2020 00:00:00 GMT</pubDate></item><item><title>节选诗一首</title><link>https://hankzhangcn.github.io/writing/2020/11/%E8%8A%82%E9%80%89%E8%AF%97%E4%B8%80%E9%A6%96/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2020/11/%E8%8A%82%E9%80%89%E8%AF%97%E4%B8%80%E9%A6%96/</guid><description>陈毅市长的诗，评论区很精彩。</description><pubDate>Tue, 24 Nov 2020 00:00:00 GMT</pubDate></item><item><title>hexo-generator-feed 的 atom 参数设置</title><link>https://hankzhangcn.github.io/writing/2020/11/hexo-generator-feed%E7%9A%84atom%E5%8F%82%E6%95%B0%E8%AE%BE%E7%BD%AE/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2020/11/hexo-generator-feed%E7%9A%84atom%E5%8F%82%E6%95%B0%E8%AE%BE%E7%BD%AE/</guid><description>配置hexo的RSS所需要参考的一些配置信息。</description><pubDate>Sat, 21 Nov 2020 00:00:00 GMT</pubDate></item><item><title>删除并回滚commit</title><link>https://hankzhangcn.github.io/writing/2020/11/%E5%88%A0%E9%99%A4%E5%B9%B6%E5%9B%9E%E6%BB%9Acommit/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2020/11/%E5%88%A0%E9%99%A4%E5%B9%B6%E5%9B%9E%E6%BB%9Acommit/</guid><description>又出bug了？回滚commit吧。</description><pubDate>Thu, 19 Nov 2020 00:00:00 GMT</pubDate></item><item><title>网易云红心</title><link>https://hankzhangcn.github.io/writing/2020/11/%E7%BD%91%E6%98%93%E4%BA%91%E7%BA%A2%E5%BF%83/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2020/11/%E7%BD%91%E6%98%93%E4%BA%91%E7%BA%A2%E5%BF%83/</guid><description>一些歌曲。</description><pubDate>Thu, 19 Nov 2020 00:00:00 GMT</pubDate></item><item><title>最长公共子序列</title><link>https://hankzhangcn.github.io/writing/2020/11/%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E5%BA%8F%E5%88%97/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2020/11/%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E5%BA%8F%E5%88%97/</guid><description>算法课程的实验三，利用动态规划方法解决LCS问题。</description><pubDate>Wed, 18 Nov 2020 00:00:00 GMT</pubDate></item><item><title>0-1背包问题的三维动态规划</title><link>https://hankzhangcn.github.io/writing/2020/11/0-1%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E7%9A%84%E4%B8%89%E7%BB%B4%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2020/11/0-1%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E7%9A%84%E4%B8%89%E7%BB%B4%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/</guid><description>算法课程的第三次作业。 针对于限制背包的最大重量、容积的情况下对0-1背包求解。</description><pubDate>Thu, 12 Nov 2020 00:00:00 GMT</pubDate></item><item><title>二分归并排序</title><link>https://hankzhangcn.github.io/writing/2020/11/%E4%BA%8C%E5%88%86%E5%BD%92%E5%B9%B6%E6%8E%92%E5%BA%8F/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2020/11/%E4%BA%8C%E5%88%86%E5%BD%92%E5%B9%B6%E6%8E%92%E5%BA%8F/</guid><description>算法课程的第二次实验。 特别简单的二分归并。你知道吗，从上世纪第一个二分搜索算法的提出到真正解决它，人们花了16年。</description><pubDate>Sun, 01 Nov 2020 00:00:00 GMT</pubDate></item><item><title>有关函数渐近的界的定理</title><link>https://hankzhangcn.github.io/writing/2020/10/%E6%9C%89%E5%85%B3%E5%87%BD%E6%95%B0%E6%B8%90%E8%BF%9B%E7%9A%84%E7%95%8C%E7%9A%84%E5%AE%9A%E7%90%86/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2020/10/%E6%9C%89%E5%85%B3%E5%87%BD%E6%95%B0%E6%B8%90%E8%BF%9B%E7%9A%84%E7%95%8C%E7%9A%84%E5%AE%9A%E7%90%86/</guid><description>算法里对于判定界的三种定理。</description><pubDate>Thu, 08 Oct 2020 00:00:00 GMT</pubDate></item><item><title>数据库原理复习</title><link>https://hankzhangcn.github.io/writing/2020/05/%E6%95%B0%E6%8D%AE%E5%BA%93%E5%8E%9F%E7%90%86%E5%A4%8D%E4%B9%A0/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2020/05/%E6%95%B0%E6%8D%AE%E5%BA%93%E5%8E%9F%E7%90%86%E5%A4%8D%E4%B9%A0/</guid><description>蒟蒻总结的数据库原理复习，理解得很浅陋。</description><pubDate>Wed, 06 May 2020 00:00:00 GMT</pubDate></item><item><title>网络daily</title><link>https://hankzhangcn.github.io/writing/2021/01/%E7%BD%91%E7%BB%9Cdaily/</link><guid isPermaLink="true">https://hankzhangcn.github.io/writing/2021/01/%E7%BD%91%E7%BB%9Cdaily/</guid><description>网络daily</description><pubDate>Mon, 04 Jan 2021 00:00:00 GMT</pubDate></item></channel></rss>