<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sdfdfsadsad</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sdfdfsadsad]]></copyright><item><title><![CDATA[关于最短分割回文的实现]]></title><link>https://blog.youkuaiyun.com/sdfdfsadsad/article/details/8878324</link><guid>https://blog.youkuaiyun.com/sdfdfsadsad/article/details/8878324</guid><author>sdfdfsadsad</author><pubDate>Fri, 03 May 2013 00:49:06 +0800</pubDate><description><![CDATA[leetcode 上源题目是这样的




Given a string s,
 partition s such
 that every substring of the partition is a palindrome.

Return the minimum cuts needed for a palindrome partitioning of s.

For ex]]></description><category></category></item><item><title><![CDATA[最短回文测试结果]]></title><link>https://blog.youkuaiyun.com/sdfdfsadsad/article/details/8801964</link><guid>https://blog.youkuaiyun.com/sdfdfsadsad/article/details/8801964</guid><author>sdfdfsadsad</author><pubDate>Mon, 15 Apr 2013 01:00:46 +0800</pubDate><description><![CDATA[\ 0 0

   
"ab" 1 
1 
   
"bb" 0 
0 
   
"cdd" 1 
1 
   
"dde" 1 
1 
   
"efe" 0 
0 
   
"fff" 0 
0 
   
"abbab" 1 
1 
   
"leet" 2 
2 
   
"coder" 4 
4 
   
"abcccb" 1]]></description><category></category></item><item><title><![CDATA[判断回文愚蠢版]]></title><link>https://blog.youkuaiyun.com/sdfdfsadsad/article/details/8775444</link><guid>https://blog.youkuaiyun.com/sdfdfsadsad/article/details/8775444</guid><author>sdfdfsadsad</author><pubDate>Mon, 08 Apr 2013 23:59:43 +0800</pubDate><description><![CDATA[class Solution {
public:
    int minCut(string s) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int a = froml(s);
        int b = fromr(]]></description><category></category></item><item><title><![CDATA[汉诺塔erlang版]]></title><link>https://blog.youkuaiyun.com/sdfdfsadsad/article/details/8029318</link><guid>https://blog.youkuaiyun.com/sdfdfsadsad/article/details/8029318</guid><author>sdfdfsadsad</author><pubDate>Fri, 28 Sep 2012 17:08:35 +0800</pubDate><description><![CDATA[刚发一个八皇后，想起汉诺塔没数组，erlang最合适，顺便看看erlang代码的优雅，呵呵


-module(hanuo).
-export([run/3]).
run(Number,Dest,From) ->
                    hannuo(true ,Number,Dest,From ).
hannuo( false, Number, Dest, From]]></description><category></category></item><item><title><![CDATA[八皇后问题Java版]]></title><link>https://blog.youkuaiyun.com/sdfdfsadsad/article/details/8029132</link><guid>https://blog.youkuaiyun.com/sdfdfsadsad/article/details/8029132</guid><author>sdfdfsadsad</author><pubDate>Fri, 28 Sep 2012 16:54:01 +0800</pubDate><description><![CDATA[最近跳槽，新公司新team，本来打算做一个超级大的平台转移项目，但是调研的人去西藏玩了，整个项目只能延迟到11月份才开始。
于是做一些无聊的事情，优化自动化测试，减少测试执行时间，测试环境还不稳定......
N天之后终于搞定了，调研的人回去休国庆假期，今天实在无聊，想想大学时候经典的汉诺塔，走台阶我都写过了，八皇后一直没写过。
用啥语言写呢，是个问题，我上个东家是做嵌入式的，所以c最顺手了]]></description><category></category></item></channel></rss>