<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[yidaitian的专栏]]></title><description><![CDATA[记录一个从文到理的思维转化过程]]></description><link>https://blog.youkuaiyun.com/dt_yee</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; dt_yee]]></copyright><item><title><![CDATA[LeetCode从零单排之一分段——Nim Game（尼姆博弈）]]></title><link>https://blog.youkuaiyun.com/dt_yee/article/details/50011059</link><guid>https://blog.youkuaiyun.com/dt_yee/article/details/50011059</guid><author>dt_yee</author><pubDate>Tue, 24 Nov 2015 12:35:49 +0800</pubDate><description><![CDATA[原题（你们这里洋文好的人很多啊，我就不瞎翻译了）：


You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who rem]]></description><category></category></item><item><title><![CDATA[LeetCode从零单排之零分段——Delete Node in a Linked List（删除链表中的元素）]]></title><link>https://blog.youkuaiyun.com/dt_yee/article/details/46898473</link><guid>https://blog.youkuaiyun.com/dt_yee/article/details/46898473</guid><author>dt_yee</author><pubDate>Wed, 15 Jul 2015 20:54:47 +0800</pubDate><description><![CDATA[原题：


Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.

Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node
]]></description><category></category></item><item><title><![CDATA[对于模糊人脸图片和原图的清晰度评估——sobel算子]]></title><link>https://blog.youkuaiyun.com/dt_yee/article/details/39313027</link><guid>https://blog.youkuaiyun.com/dt_yee/article/details/39313027</guid><author>dt_yee</author><pubDate>Tue, 16 Sep 2014 09:34:42 +0800</pubDate><description><![CDATA[评估图像清晰度是一个常见的问题。其中主要分为动态和对焦两种。]]></description><category></category></item></channel></rss>