<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[todedu的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/todedu</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; todedu]]></copyright><item><title><![CDATA[Dijkstra's Algorithm of shortest path]]></title><link>https://blog.youkuaiyun.com/todedu/article/details/25089001</link><guid>https://blog.youkuaiyun.com/todedu/article/details/25089001</guid><author>todedu</author><pubDate>Tue, 06 May 2014 02:26:04 +0800</pubDate><description><![CDATA[If you do graph, sooner or later you will reach this point, Dijkstra :) 
T]]></description><category></category></item><item><title><![CDATA[Let me go home :)]]></title><link>https://blog.youkuaiyun.com/todedu/article/details/24335097</link><guid>https://blog.youkuaiyun.com/todedu/article/details/24335097</guid><author>todedu</author><pubDate>Wed, 23 Apr 2014 00:23:23 +0800</pubDate><description><![CDATA[Last Christmas, wife and I visited NC :)]]></description><category></category></item><item><title><![CDATA[Sudoku Solver, Now it's possible to solve expert level question in less than 2 minutes]]></title><link>https://blog.youkuaiyun.com/todedu/article/details/21510507</link><guid>https://blog.youkuaiyun.com/todedu/article/details/21510507</guid><author>todedu</author><pubDate>Wed, 19 Mar 2014 09:16:59 +0800</pubDate><description><![CDATA[Write a program to solve a Sudoku puzzle by filling the empty cells.

Empty cells are indicated by the character '.'.

You may assume that there will be only one unique solution.




A sudoku]]></description><category></category></item><item><title><![CDATA[Interleaving String 一个月前没做出来的题目，闷了三天终于闷出来了]]></title><link>https://blog.youkuaiyun.com/todedu/article/details/21499613</link><guid>https://blog.youkuaiyun.com/todedu/article/details/21499613</guid><author>todedu</author><pubDate>Wed, 19 Mar 2014 03:26:15 +0800</pubDate><description><![CDATA[Interleaving String

Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.

For example,
Given:
s1 = "aabcc",
s2 = "dbbca",

When s3 = "aadbbcbcac", return true.
When]]></description><category></category></item><item><title><![CDATA[Halfway to go, though I have finished 145 questions of leetcode online judge]]></title><link>https://blog.youkuaiyun.com/todedu/article/details/21368055</link><guid>https://blog.youkuaiyun.com/todedu/article/details/21368055</guid><author>todedu</author><pubDate>Mon, 17 Mar 2014 08:09:53 +0800</pubDate><description><![CDATA[It's quite a long way to go, step by step.
In my private opinion, there are 3 (or 4) steps to divide and 'conquer' Leetcode questions;
1st step, there might be about 50 easy questions, normally thes]]></description><category></category></item><item><title><![CDATA[hello csdn blog :)]]></title><link>https://blog.youkuaiyun.com/todedu/article/details/20528809</link><guid>https://blog.youkuaiyun.com/todedu/article/details/20528809</guid><author>todedu</author><pubDate>Wed, 05 Mar 2014 10:11:45 +0800</pubDate><description><![CDATA[This is my first blog here at 优快云 blog. 
It's awful that I even don't know how many years have I been using 优快云, maybe over 10 years?
Yes, a lot to blame, ==! I wasted 10 of my best years doing re]]></description><category></category></item></channel></rss>