<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Haniel的博客]]></title><description><![CDATA[Catch Your Dream]]></description><link>https://blog.youkuaiyun.com/HanielF</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; HanielF]]></copyright><item><title><![CDATA[动态规划套路详解]]></title><link>https://blog.youkuaiyun.com/HanielF/article/details/102852508</link><guid>https://blog.youkuaiyun.com/HanielF/article/details/102852508</guid><author>HanielF</author><pubDate>Fri, 01 Nov 2019 10:23:32 +0800</pubDate><description><![CDATA[前言
在LeetCode的322题题解中看到一篇动态规划的详解，讲的很清楚，转载记录下
转自：LeetCode动态规划套路详解

介绍&amp;闲谈
下面通过对斐波那契数列和这道凑零钱问题详解动态规划。如果只想看本题的答案，请直接翻到最后查看。
动态规划算法似乎是一种很高深莫测的算法，你会在一些面试或算法书籍的高级技巧部分看到相关内容，什么状态转移方程，重叠子问题，最优子结构等高大上的词汇也可能让...]]></description><category></category></item><item><title><![CDATA[Archlinux的灵魂──PKGBUILD、AUR 和 ABS]]></title><link>https://blog.youkuaiyun.com/HanielF/article/details/97404731</link><guid>https://blog.youkuaiyun.com/HanielF/article/details/97404731</guid><author>HanielF</author><pubDate>Fri, 26 Jul 2019 18:49:21 +0800</pubDate><description><![CDATA[原文已经不知道在哪, 看到的也是转发的, 转自[Archlinux 的灵魂──PKGBUILD、AUR 和 ABS](https://blog.youkuaiyun.com/taiyang1987912/article/details/41457333)

觉得看完对深入理解Arch很有帮助. 文章很长, 耐心点看完, 肯定会有收获]]></description><category></category></item><item><title><![CDATA[LeetCode-025-Reverse Nodes in k-Group]]></title><link>https://blog.youkuaiyun.com/HanielF/article/details/97196944</link><guid>https://blog.youkuaiyun.com/HanielF/article/details/97196944</guid><author>HanielF</author><pubDate>Thu, 25 Jul 2019 01:35:09 +0800</pubDate><description><![CDATA[Problem
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.
k is a positive integer and is less than or equal to the length of the linked list. If the num...]]></description><category></category></item><item><title><![CDATA[LeetCode-024-Swap Nodes in Pairs]]></title><link>https://blog.youkuaiyun.com/HanielF/article/details/97062126</link><guid>https://blog.youkuaiyun.com/HanielF/article/details/97062126</guid><author>HanielF</author><pubDate>Wed, 24 Jul 2019 01:31:09 +0800</pubDate><description><![CDATA[## Problem 
Given a linked list, swap every two adjacent nodes and return its head.
You may **not** modify the values in the list's nodes, only nodes itself may be changed.

我的博客: [hanielxx.com](https://hanielxx.com)]]></description><category></category></item><item><title><![CDATA[LeetCode-022-Generate Parentheses]]></title><link>https://blog.youkuaiyun.com/HanielF/article/details/96925769</link><guid>https://blog.youkuaiyun.com/HanielF/article/details/96925769</guid><author>HanielF</author><pubDate>Tue, 23 Jul 2019 01:16:21 +0800</pubDate><description><![CDATA[Problem
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.]]></description><category></category></item><item><title><![CDATA[ArchLinux-Gnome下触摸板设置]]></title><link>https://blog.youkuaiyun.com/HanielF/article/details/96919656</link><guid>https://blog.youkuaiyun.com/HanielF/article/details/96919656</guid><author>HanielF</author><pubDate>Tue, 23 Jul 2019 00:17:08 +0800</pubDate><description><![CDATA[前言
Arch下触摸板默认是没有模拟鼠标单击双击功能的, 通过设置可以修改,具体参考ArchWiki
这里没有使用配置文件,只是用Synclient这个命令行工具设置]]></description><category></category></item><item><title><![CDATA[LeetCode-019-Remove Nth Node From End of List]]></title><link>https://blog.youkuaiyun.com/HanielF/article/details/96794405</link><guid>https://blog.youkuaiyun.com/HanielF/article/details/96794405</guid><author>HanielF</author><pubDate>Mon, 22 Jul 2019 02:12:17 +0800</pubDate><description><![CDATA[Problem
Given a linked list, remove the n-th node from the end of list and return its head.
Note:
Given n will always be valid.
Examples:
**Input:**1-&gt;2-&gt;3-&gt;4-&gt;5, and n = 2.
After removing...]]></description><category></category></item><item><title><![CDATA[博客域名更新]]></title><link>https://blog.youkuaiyun.com/HanielF/article/details/96758714</link><guid>https://blog.youkuaiyun.com/HanielF/article/details/96758714</guid><author>HanielF</author><pubDate>Sun, 21 Jul 2019 20:35:58 +0800</pubDate><description><![CDATA[博客域名从catchdream.me更新为hanielxx.com
特此通知.

]]></description><category></category></item><item><title><![CDATA[Arch安装和Gnome配置教程]]></title><link>https://blog.youkuaiyun.com/HanielF/article/details/96746446</link><guid>https://blog.youkuaiyun.com/HanielF/article/details/96746446</guid><author>HanielF</author><pubDate>Sun, 21 Jul 2019 18:43:35 +0800</pubDate><description><![CDATA[前言
两天前,我的arch,被我不小心升级glibc搞坏了…很久前就想重装下系统的,因此也就懒得重新再修复了,直接重装一个也挺好.
但是!隔了这么久重装系统搞得我心态都快崩了,各种找资料.
现在终于弄好啦,还是决定记录一下,以后就不用那么担心教程靠不靠谱
我的博客: catchdream.me
文章原文: arch安装和gnome配置教程

说明

已有系统: Win10
安装系统: archli...]]></description><category></category></item><item><title><![CDATA[LeetCode-018-4Sum]]></title><link>https://blog.youkuaiyun.com/HanielF/article/details/96388584</link><guid>https://blog.youkuaiyun.com/HanielF/article/details/96388584</guid><author>HanielF</author><pubDate>Thu, 18 Jul 2019 00:08:36 +0800</pubDate><description><![CDATA[前言
刚决定以后将博客同步到csnd和简书，考虑到将以前的博客迁移到这边比较麻烦，就不迁移了。只同步以后的博客。
所以，如果想了解前面的博客内容，请移步原博客
Problem
Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a +...]]></description><category></category></item><item><title><![CDATA[记2019南大计算机本科生开放日/夏令营]]></title><link>https://blog.youkuaiyun.com/HanielF/article/details/95677016</link><guid>https://blog.youkuaiyun.com/HanielF/article/details/95677016</guid><author>HanielF</author><pubDate>Fri, 12 Jul 2019 23:34:33 +0800</pubDate><description><![CDATA[[最近更新：2019.10.2]
- 记录南大夏令营的全程，包括**准备阶段**和**夏令营阶段**以及**夏令营之后**。 
- 记录一些保研的**经验**,**注意点**。写了很多给学弟学妹们的话，希望你们保研能够顺利，**避免踩坑**。
- 记录自己整个保研过程的**感受**，以及一些想写下来的东西。]]></description><category></category></item></channel></rss>