<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[蜗牛随笔]]></title><description><![CDATA[狂奔的蜗牛]]></description><link>https://blog.youkuaiyun.com/wudawei121</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wudawei121]]></copyright><item><title><![CDATA[KMP C++]]></title><link>https://blog.youkuaiyun.com/wudawei121/article/details/42103881</link><guid>https://blog.youkuaiyun.com/wudawei121/article/details/42103881</guid><author>wudawei121</author><pubDate>Tue, 23 Dec 2014 16:01:17 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;

void print(const int* p, const int &n){
	cout << "前缀数组：";
	for(int i = 0; i < n - 1; i++){
		cout << *(p++) << " ";
	}
	cout << *p << endl;
}

int *prefix(con]]></description><category></category></item><item><title><![CDATA[java 中文字符字节大小]]></title><link>https://blog.youkuaiyun.com/wudawei121/article/details/14420535</link><guid>https://blog.youkuaiyun.com/wudawei121/article/details/14420535</guid><author>wudawei121</author><pubDate>Wed, 06 Nov 2013 22:22:11 +0800</pubDate><description><![CDATA[String name = "吴";
		System.out.println(name.getBytes("gb2312").length);// 2
		System.out.println(name.getBytes("utf-8").length);// 3
		System.out.println(name.getBytes("gbk").length);// 2
		System.ou]]></description><category></category></item><item><title><![CDATA[LeetCode "Palindrome Partitioning"算法时间复杂度分析]]></title><link>https://blog.youkuaiyun.com/wudawei121/article/details/11781857</link><guid>https://blog.youkuaiyun.com/wudawei121/article/details/11781857</guid><author>wudawei121</author><pubDate>Tue, 17 Sep 2013 18:10:56 +0800</pubDate><description><![CDATA[]]></description><category></category></item></channel></rss>