<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[思卟予]]></title><description><![CDATA[人生就是要马不停蹄……]]></description><link>https://blog.youkuaiyun.com/wangxiaoyan381</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wangxiaoyan381]]></copyright><item><title><![CDATA[递归+回溯+leetcode原题讲解]]></title><link>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/81166431</link><guid>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/81166431</guid><author>wangxiaoyan381</author><pubDate>Mon, 23 Jul 2018 19:55:37 +0800</pubDate><description><![CDATA[从大学就一直对递归很迷糊，想不清楚，最近刷leetcode这又是绕不过去的弯，索性这次认真研究一下并做个总结。

这里关于回溯讲解的比较容易懂。https://blog.youkuaiyun.com/versencoder/article/details/52071930

大概总结一下总有一个套路

定义一个全局结果用于保存最终的答案ans
	定义一个辅助方法（函数）void backtrack(){},一...]]></description><category></category></item><item><title><![CDATA[Java并发编程：volatile关键字解析]]></title><link>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/50255205</link><guid>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/50255205</guid><author>wangxiaoyan381</author><pubDate>Thu, 10 Dec 2015 22:23:41 +0800</pubDate><description><![CDATA[﻿﻿
原文转自　　http://www.cnblogs.com/dolphin0520/p/3920373.html
 volatile这个关键字可能很多朋友都听说过，或许也都用过。在Java 5之前，它是一个备受争议的关键字，因为在程序中使用它往往会导致出人意料的结果。在Java 5之后，volatile关键字才得以重获生机。
　　volatile关键字虽然从字面上理解起来比较简单，但是要]]></description><category></category></item><item><title><![CDATA[线程安全和线程不安全]]></title><link>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/49847305</link><guid>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/49847305</guid><author>wangxiaoyan381</author><pubDate>Sun, 15 Nov 2015 10:11:25 +0800</pubDate><description><![CDATA[本文转自http://www.cnblogs.com/zwq194/archive/2012/06/26/2563567.html


首先要明白线程的工作原理，jvm有一个main   memory，而每个线程有自己的working   memory，一个线程对一个variable进行操作时，都要在自己的working   memory里面建立一个copy，操作完之后再写入main   m]]></description><category></category></item><item><title><![CDATA[java中volatile关键字的含义]]></title><link>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/49813491</link><guid>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/49813491</guid><author>wangxiaoyan381</author><pubDate>Fri, 13 Nov 2015 09:47:45 +0800</pubDate><description><![CDATA[本文转自http://www.cnblogs.com/aigongsi/archive/2012/04/01/2429166.html


在java线程并发处理中，有一个关键字volatile的使用目前存在很大的混淆，以为使用这个关键字，在进行多线程并发处理的时候就可以万事大吉。

Java语言是支持多线程的，为了解决线程并发的问题，在语言内部引入了 同步块 和 volatile 关键]]></description><category></category></item><item><title><![CDATA[指令重排序及Happens-before法则]]></title><link>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/49801067</link><guid>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/49801067</guid><author>wangxiaoyan381</author><pubDate>Thu, 12 Nov 2015 16:38:16 +0800</pubDate><description><![CDATA[本文转自点击打开链接
指令重排序

对主存的一次访问一般花费硬件的数百次时钟周期。处理器通过缓存（caching）能够从数量级上降低内存延迟的成本这些缓存为了性能重新排列待定内存操作的顺序。也就是说，程序的读写操作不一定会按照它要求处理器的顺序执行。


重排序的背景
我们知道现代CPU的主频越来越高，与cache的交互次数也越来越多。当CPU的计算速度远远超过访问cache时，会产]]></description><category></category></item><item><title><![CDATA[JAVA操作properties文件]]></title><link>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/39807185</link><guid>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/39807185</guid><author>wangxiaoyan381</author><pubDate>Sun, 05 Oct 2014 21:54:46 +0800</pubDate><description><![CDATA[原文地址：http://www.cnblogs.com/panjun-Donet/archive/2009/07/17/1525597.html]]></description><category></category></item><item><title><![CDATA[Eclipse常用快捷键]]></title><link>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/39436443</link><guid>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/39436443</guid><author>wangxiaoyan381</author><pubDate>Sat, 20 Sep 2014 22:33:05 +0800</pubDate><description><![CDATA[Alt+Shit+S Generaet Getter and Setter 


选中Generate method comments 

文本编辑 复制行 Ctrl+Alt+向下键 编辑文本 

快捷键:选中接口名按ctrl+t 会列出所有实现此接口的类 

ctrl+o 找到这个类中的所有方法 

Ctrl+O 快速显示 OutLine 
Ctrl+T 快速显示当前类的]]></description><category></category></item><item><title><![CDATA[poj 1011 Sticks(搜索+剪枝)]]></title><link>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38870431</link><guid>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38870431</guid><author>wangxiaoyan381</author><pubDate>Wed, 27 Aug 2014 14:40:27 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=1011
题意：给出一些等changde]]></description><category></category></item><item><title><![CDATA[JSP和JS的区别]]></title><link>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38842883</link><guid>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38842883</guid><author>wangxiaoyan381</author><pubDate>Tue, 26 Aug 2014 09:13:19 +0800</pubDate><description><![CDATA[转自
该篇入门转自《JSP高级编程》一书。

希望大家在看完本入门之后能分清楚jsp（Java Server Pages）和js（java script）的区别。

希望这两篇文档对大家能有所帮助！

............................................................................................]]></description><category></category></item><item><title><![CDATA[HDU 2492 pingpang]]></title><link>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38777927</link><guid>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38777927</guid><author>wangxiaoyan381</author><pubDate>Sat, 23 Aug 2014 13:43:53 +0800</pubDate><description><![CDATA[Problem Description

N(3

Each player has a unique skill rank. To improve their skill rank, they often compete with each other. If two players want to compete, they must choose a referee among oth]]></description><category></category></item><item><title><![CDATA[分数拆分]]></title><link>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38661861</link><guid>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38661861</guid><author>wangxiaoyan381</author><pubDate>Mon, 18 Aug 2014 15:55:23 +0800</pubDate><description><![CDATA[输入正整数]]></description><category></category></item><item><title><![CDATA[最大乘积]]></title><link>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38661019</link><guid>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38661019</guid><author>wangxiaoyan381</author><pubDate>Mon, 18 Aug 2014 15:14:55 +0800</pubDate><description><![CDATA[输入n个元素组成的xul]]></description><category></category></item><item><title><![CDATA[暴力求解法之简单枚举--除法]]></title><link>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38660011</link><guid>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38660011</guid><author>wangxiaoyan381</author><pubDate>Mon, 18 Aug 2014 14:18:46 +0800</pubDate><description><![CDATA[输入正整数n，按从小到大的顺序输出所有形如abcde/fghij=n的表达式，其中a~j恰好为数字0
~9 的一个排列，2
样例输入：
62
样例输出：
79546 / 01283 = 62
94736 / 05128 = 62
【分析】 不需要枚举所有的排列，只需要枚举被除数，除数自然可以计算出来
不过由于细节问题，也是搞了挺久，各种磕磕绊绊，还是题目做少了，经验不足，下面贴上两]]></description><category></category></item><item><title><![CDATA[字典树 HDU- 1671 Phone List]]></title><link>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38611093</link><guid>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38611093</guid><author>wangxiaoyan381</author><pubDate>Sat, 16 Aug 2014 10:39:22 +0800</pubDate><description><![CDATA[题目链接http://acm.hdu.edu.cn/showproblem.php?pid=1671]]></description><category></category></item><item><title><![CDATA[字典树 HDU-1251统计难题]]></title><link>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38610877</link><guid>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38610877</guid><author>wangxiaoyan381</author><pubDate>Sat, 16 Aug 2014 10:17:35 +0800</pubDate><description><![CDATA[关于字典树的讲解请参见]]></description><category></category></item><item><title><![CDATA[ST算法解决RMQ问题及UVA 11235题解]]></title><link>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38514183</link><guid>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38514183</guid><author>wangxiaoyan381</author><pubDate>Tue, 12 Aug 2014 13:47:48 +0800</pubDate><description><![CDATA[范围最小值问题]]></description><category></category></item><item><title><![CDATA[poj 1394 Minimum Inversion Number]]></title><link>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38299307</link><guid>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38299307</guid><author>wangxiaoyan381</author><pubDate>Wed, 30 Jul 2014 13:49:47 +0800</pubDate><description><![CDATA[Problem Description

The inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i  aj.

For a given sequence of numbers a1, a2, ..., an, if we mov]]></description><category></category></item><item><title><![CDATA[HDU1166 敌兵布阵]]></title><link>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38272385</link><guid>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38272385</guid><author>wangxiaoyan381</author><pubDate>Tue, 29 Jul 2014 16:20:20 +0800</pubDate><description><![CDATA[Problem Description
C国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生变动，可能增加或减少若干人手,但这些都逃不过C国的监视。]]></description><category></category></item><item><title><![CDATA[UVA 10474 - Where is the Marble?]]></title><link>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38230689</link><guid>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38230689</guid><author>wangxiaoyan381</author><pubDate>Mon, 28 Jul 2014 15:17:15 +0800</pubDate><description><![CDATA[Where is the Marble?
Raju and Meena love to play with Marbles. They have got a lot of marbles with numbers written on them. At the beginning, Raju would place the marbles one after another in ascendi]]></description><category></category></item><item><title><![CDATA[百练4980 拯救行动[BFS]]]></title><link>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38140539</link><guid>https://blog.youkuaiyun.com/wangxiaoyan381/article/details/38140539</guid><author>wangxiaoyan381</author><pubDate>Sat, 26 Jul 2014 10:06:16 +0800</pubDate><description><![CDATA[公主被恶人抓走，被关押在牢房的某个地方。牢房用N*M 
(N, M 
、墙壁（#）、和守卫（x）。
英勇的骑士（r）决定孤身一人去拯救公主（a）。我们假设
拯救成功的表示是‚骑士到达了公主所在的位置‛。由于在通往
公主所在位置的道路中可能遇到守卫，骑士一旦遇到守卫，必须
杀死守卫才能继续前进。
现假设骑士可以向上、下、左、右四个方向移动，每移动一
个位置需要1个单位时间，杀死一个守]]></description><category></category></item></channel></rss>