<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[think_tom的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/think_tom</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; think_tom]]></copyright><item><title><![CDATA[Migrating spring 4 from spring 3]]></title><link>https://blog.youkuaiyun.com/think_tom/article/details/53669881</link><guid>https://blog.youkuaiyun.com/think_tom/article/details/53669881</guid><author>think_tom</author><pubDate>Thu, 15 Dec 2016 14:24:22 +0800</pubDate><description><![CDATA[今天把Spring从3.2.9升级到了4.3.4，SpringSecurity从3.2.5升级到了4.2.0，下面是升级过程遇到的一些问题：



Spring4 删除了MetadataUtils类，MetadataUtils类中的attributesFor方法移动到了AnnotationConfigUtils中



AuthenticationException 删除了 get]]></description><category></category></item><item><title><![CDATA[正则非匹配]]></title><link>https://blog.youkuaiyun.com/think_tom/article/details/38374485</link><guid>https://blog.youkuaiyun.com/think_tom/article/details/38374485</guid><author>think_tom</author><pubDate>Mon, 04 Aug 2014 20:26:58 +0800</pubDate><description><![CDATA[^(?!.*df).*$     df就是你不想匹配的一个字符串了。]]></description><category></category></item><item><title><![CDATA[Linux 内核编译]]></title><link>https://blog.youkuaiyun.com/think_tom/article/details/24713327</link><guid>https://blog.youkuaiyun.com/think_tom/article/details/24713327</guid><author>think_tom</author><pubDate>Tue, 29 Apr 2014 14:43:59 +0800</pubDate><description><![CDATA[环境：虚拟机VMware (ubuntu12.04)     内核版本linux-3.2.0-23-generic-pae]]></description><category></category></item><item><title><![CDATA[JavaScript的作用域的一点注意]]></title><link>https://blog.youkuaiyun.com/think_tom/article/details/20799739</link><guid>https://blog.youkuaiyun.com/think_tom/article/details/20799739</guid><author>think_tom</author><pubDate>Sat, 08 Mar 2014 21:57:11 +0800</pubDate><description><![CDATA[描述：

在写JS的遇到了一个关于作用域的问题，后来通过网上查找资料才知道JS是没有块级作用域的，JS变量的作用域是在整个函数中。

下面说一下是我遇到的问题：

var priceFormulars = ['balabala一些数据','balabala一些数据'];
function savaSalesPolicyData(){
	poclicy.price = priceForm]]></description><category></category></item><item><title><![CDATA[讲讲Mongodb的24位ObjectId的无损压缩]]></title><link>https://blog.youkuaiyun.com/think_tom/article/details/19929933</link><guid>https://blog.youkuaiyun.com/think_tom/article/details/19929933</guid><author>think_tom</author><pubDate>Tue, 25 Feb 2014 20:04:10 +0800</pubDate><description><![CDATA[由于工作原因需要将mongodb 的24位字符Id转成16位字符表示，通过对ObjectId的生成的理解，可以知道其是由24个16进制字符表示的，也就是12个字节，如果使用64进制字符来显示ID，那么只需要16位便可表示ID，并且可以相互状换。]]></description><category></category></item><item><title><![CDATA[Spring3中js/css/jpg/gif等静态资源无法找到（No mapping found for HTTP request with URI）问题解决]]></title><link>https://blog.youkuaiyun.com/think_tom/article/details/18958941</link><guid>https://blog.youkuaiyun.com/think_tom/article/details/18958941</guid><author>think_tom</author><pubDate>Fri, 07 Feb 2014 10:30:08 +0800</pubDate><description><![CDATA[------------------以下为引用----------------------



最近项目中使用到Spring3，在感叹Spring3注解配置清爽的同时竟然出现了这个不和谐的事情，实在无法忍受

问题：部署项目后程序加载或用浏览器访问时出现类似的警告，2011-01-19 10:52:51,646 WARN [org.springframework.web.servle]]></description><category></category></item><item><title><![CDATA[Spring 配置文件中元素 'ref' 中不允许出现属性 'local']]></title><link>https://blog.youkuaiyun.com/think_tom/article/details/17411423</link><guid>https://blog.youkuaiyun.com/think_tom/article/details/17411423</guid><author>think_tom</author><pubDate>Thu, 19 Dec 2013 10:44:38 +0800</pubDate><description><![CDATA[好像只需要把local改成bean就可以了。]]></description><category></category></item><item><title><![CDATA[大数加减乘除取余]]></title><link>https://blog.youkuaiyun.com/think_tom/article/details/8797602</link><guid>https://blog.youkuaiyun.com/think_tom/article/details/8797602</guid><author>think_tom</author><pubDate>Sat, 13 Apr 2013 17:59:46 +0800</pubDate><description><![CDATA[除了除法取模两个函数，每个运算函数不依赖其它函数；
减法函数只支持较大的数减去较小的数；
函数参数为操作数a，操作数b，存放结果c，进制 radix 推荐设为10；
大数格式为，a[0] 表示位数，a[1] 存放个位，依次存放高位
main 为测试函数；

#include
//#include
using namespace std;

void StrToDigit(const c]]></description><category></category></item><item><title><![CDATA[POJ1088滑雪]]></title><link>https://blog.youkuaiyun.com/think_tom/article/details/8688036</link><guid>https://blog.youkuaiyun.com/think_tom/article/details/8688036</guid><author>think_tom</author><pubDate>Mon, 18 Mar 2013 17:09:06 +0800</pubDate><description><![CDATA[#include

int map[102][102],length[102][102];

int max(int x,int y,int z,int k)
{
	if(x<y)x=y;
	if(x<z)x=z;
	if(x<k)x=k;
	return x;
}
int ident(int i,int j)
{
	if(map[i][j]==-1)return 0;
	if(length[i]]]></description><category></category></item><item><title><![CDATA[POJ3981字符串替换]]></title><link>https://blog.youkuaiyun.com/think_tom/article/details/8685081</link><guid>https://blog.youkuaiyun.com/think_tom/article/details/8685081</guid><author>think_tom</author><pubDate>Sun, 17 Mar 2013 22:17:45 +0800</pubDate><description><![CDATA[#include
int main(void)
{
	char ch1,ch2,ch3;
	while((ch1=getchar())!=EOF)
	{
		if(ch1=='y')
		{
			if((ch2=getchar())=='o')
			{
				if((ch3=getchar())=='u')
				{
					printf("we");
				}
				else pr]]></description><category></category></item><item><title><![CDATA[POJ1008玛雅历]]></title><link>https://blog.youkuaiyun.com/think_tom/article/details/8685061</link><guid>https://blog.youkuaiyun.com/think_tom/article/details/8685061</guid><author>think_tom</author><pubDate>Sun, 17 Mar 2013 22:16:15 +0800</pubDate><description><![CDATA[变量定义的有点乱
#include
#include
int main(void)
{
	char Haab[19][10]={"pop","no","zip","zotz","tzec","xul","yoxkin","mol","chen","yax","zac","ceh","mac","kankin","muan","pax","koyab","cumhu","uayet"};
	cha]]></description><category></category></item><item><title><![CDATA[POJ1007DNA Sorting]]></title><link>https://blog.youkuaiyun.com/think_tom/article/details/8685032</link><guid>https://blog.youkuaiyun.com/think_tom/article/details/8685032</guid><author>think_tom</author><pubDate>Sun, 17 Mar 2013 22:12:48 +0800</pubDate><description><![CDATA[m个长度为n的DNA序列，把他们按照逆序数从小到大稳定排序输出。

 

解题思路：

先求各个字符串的逆序数，然后有两个思路，一是按逆序数对字符串快排，如http://blog.youkuaiyun.com/lyy289065406/article/details/6647305

第二个思路是只需要按逆序数从小到大输出就好了，不需要对字符串排序，省下了排序的时间





#i]]></description><category></category></item><item><title><![CDATA[POJ1006生理周期]]></title><link>https://blog.youkuaiyun.com/think_tom/article/details/8685004</link><guid>https://blog.youkuaiyun.com/think_tom/article/details/8685004</guid><author>think_tom</author><pubDate>Sun, 17 Mar 2013 22:03:30 +0800</pubDate><description><![CDATA[Description

人生来就有三个生理周期，分别为体力、感情和智力周期，它们的周期长度为23天、28天和33天。每一个周期中有一天是高峰。在高峰这天，人会在相应的方面表现出色。例如，智力周期的高峰，人会思维敏捷，精力容易高度集中。因为三个周期的周长不同，所以通常三个周期的高峰不会落在同一天。对于每个人，我们想知道何时三个高峰落在同一天。对于每个周期，我们会给出从当前年份的第一天开始，到出]]></description><category></category></item><item><title><![CDATA[POJ1003，POJ1004，POJ1005]]></title><link>https://blog.youkuaiyun.com/think_tom/article/details/8684990</link><guid>https://blog.youkuaiyun.com/think_tom/article/details/8684990</guid><author>think_tom</author><pubDate>Sun, 17 Mar 2013 21:59:06 +0800</pubDate><description><![CDATA[POJ1003：
#include
int main(void)
{
	float f;
	scanf("%f",&f);
	while(f!=0)
	{
		int i=0;
		float ff=0;
		do{
			i++;
			ff += 1.0/(i+1);
		}while(ff<f);
		printf("%d card(s)\n",i);
		scanf("%f",&f);]]></description><category></category></item><item><title><![CDATA[POJ1001 求高精度幂]]></title><link>https://blog.youkuaiyun.com/think_tom/article/details/8684941</link><guid>https://blog.youkuaiyun.com/think_tom/article/details/8684941</guid><author>think_tom</author><pubDate>Sun, 17 Mar 2013 21:53:40 +0800</pubDate><description><![CDATA[Sample Output 完全正确，但提交后过不了，懒得找瑕疵了
#include
#include

void power(const int num[],const int n,int point)
{
	int i,j,k;
	int len,ans[200],temp[200];
	for(i=0;i<200;i++){ans[i]=0;temp[i]=0;}
	
	for(i=0;i]]></description><category></category></item><item><title><![CDATA[小米2013校园招聘笔试最后一题（朋友圈）]]></title><link>https://blog.youkuaiyun.com/think_tom/article/details/8615711</link><guid>https://blog.youkuaiyun.com/think_tom/article/details/8615711</guid><author>think_tom</author><pubDate>Sat, 09 Mar 2013 23:27:36 +0800</pubDate><description><![CDATA[#include

int friends(int n,int m,int r[][2])
{
    int i,count=0;
    
    //用Q数组来记录每个节点的好友节点，并初始化
    int Q[n+1];
    for(i=0;i<=n;i++)
        {Q[i]=0;}
    
    for(i=0;i<m;i++)
    {]]></description><category></category></item><item><title><![CDATA[Crawlzilla搭建]]></title><link>https://blog.youkuaiyun.com/think_tom/article/details/8231460</link><guid>https://blog.youkuaiyun.com/think_tom/article/details/8231460</guid><author>think_tom</author><pubDate>Tue, 27 Nov 2012 19:20:18 +0800</pubDate><description><![CDATA[crawlzilla 介绍：http://code.google.com/p/crawlzilla/wiki/SystemInstall
安装：
1、sun-java6
sudo add-apt-repository "deb http://us.archive.ubuntu.com/ubuntu/ hardy multiverse"
sudo apt-get update
sudo a]]></description><category></category></item></channel></rss>