<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[WILL的专栏]]></title><description><![CDATA[做最坚强的泡沫]]></description><link>https://blog.youkuaiyun.com/u010368749</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u010368749]]></copyright><item><title><![CDATA[【转】JVM知识点汇总]]></title><link>https://blog.youkuaiyun.com/u010368749/article/details/81910767</link><guid>https://blog.youkuaiyun.com/u010368749/article/details/81910767</guid><author>u010368749</author><pubDate>Tue, 21 Aug 2018 17:00:12 +0800</pubDate><description><![CDATA[https://blog.youkuaiyun.com/huyuyang6688/article/details/81490570]]></description><category></category></item><item><title><![CDATA[swagger ui和spring boot集成生成api文档]]></title><link>https://blog.youkuaiyun.com/u010368749/article/details/71214155</link><guid>https://blog.youkuaiyun.com/u010368749/article/details/71214155</guid><author>u010368749</author><pubDate>Fri, 05 May 2017 16:19:59 +0800</pubDate><description><![CDATA[通过本篇文章，你可以学会通过配置生成接口文档，再也不用通过Postman来测试自己的接口啦。。。

一、环境
1. JAVA8
2. MAVEN 3.0.5
3. IDEA 2016.2.5
4. spring boot 1.4.1
二、相关依赖

    io.springfox
    springfox-swagger-ui
    2.2.2


    io.spring]]></description><category></category></item><item><title><![CDATA[left join加上where条件的困惑，（left join 无用 / 无效 ）]]></title><link>https://blog.youkuaiyun.com/u010368749/article/details/59482870</link><guid>https://blog.youkuaiyun.com/u010368749/article/details/59482870</guid><author>u010368749</author><pubDate>Thu, 02 Mar 2017 10:16:28 +0800</pubDate><description><![CDATA[left join的困惑：一旦加上where条件，则显示的结果等于inner join

将where 换成 and  

用where 是先连接然后再筛选   
用and 是先筛选再连接

数据库在通过连接两张或多张表来返回记录时，都会生成一张中间的临时表，然后再将这张临时表返回给用户。

      在使用left jion时，on和where条件的区别如下：

1、 o]]></description><category></category></item><item><title><![CDATA[Spring源码解析]]></title><link>https://blog.youkuaiyun.com/u010368749/article/details/54923641</link><guid>https://blog.youkuaiyun.com/u010368749/article/details/54923641</guid><author>u010368749</author><pubDate>Wed, 08 Feb 2017 10:21:29 +0800</pubDate><description><![CDATA[Spring源码解析（收藏）


Spring源代码解析(一）：IOC容器:http://www.iteye.com/topic/86339 
Spring源代码解析(二)：IoC容器在Web容器中的启动:http://www.iteye.com/topic/86594

Spring源代码解析(三）：Spring JDBC:http://www.iteye.com/topic/870]]></description><category></category></item><item><title><![CDATA[JVM原理]]></title><link>https://blog.youkuaiyun.com/u010368749/article/details/52931567</link><guid>https://blog.youkuaiyun.com/u010368749/article/details/52931567</guid><author>u010368749</author><pubDate>Wed, 26 Oct 2016 09:57:32 +0800</pubDate><description><![CDATA[一、Java虚拟机的生命周期：

　　Java虚拟机的生命周期 一个运行中的Java虚拟机有着一个清晰的任务：执行Java程序。程序开始执行时他才运行，程序结束时他就停止。你在同一台机器上运行三个程序，就会有三个运行中的Java虚拟机。 Java虚拟机总是开始于一个main()方法，这个方法必须是公有、返回void、直接受一个字符串数组。在程序执行时，你必须给Java虚拟机指明这个包换main]]></description><category></category></item><item><title><![CDATA[uva10534---Wavio Sequence]]></title><link>https://blog.youkuaiyun.com/u010368749/article/details/22100453</link><guid>https://blog.youkuaiyun.com/u010368749/article/details/22100453</guid><author>u010368749</author><pubDate>Tue, 25 Mar 2014 21:23:40 +0800</pubDate><description><![CDATA[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=17&problem=1475&mosmsg=Submission+received+with+ID+13386999



Wavio is a sequence of integers. It h]]></description><category></category></item><item><title><![CDATA[hdu1087---Super Jumping! Jumping! Jumping!]]></title><link>https://blog.youkuaiyun.com/u010368749/article/details/21983743</link><guid>https://blog.youkuaiyun.com/u010368749/article/details/21983743</guid><author>u010368749</author><pubDate>Mon, 24 Mar 2014 19:57:48 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1087

Problem Description
Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and kn]]></description><category></category></item><item><title><![CDATA[hdu1677--Nested Dolls（贪心+LIS）]]></title><link>https://blog.youkuaiyun.com/u010368749/article/details/21980673</link><guid>https://blog.youkuaiyun.com/u010368749/article/details/21980673</guid><author>u010368749</author><pubDate>Mon, 24 Mar 2014 19:19:43 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1677

Problem Description
Dilworth is the world’s most prominent collector of Russian nested dolls: he literally has thousands of them! You know, the woode]]></description><category></category></item><item><title><![CDATA[codeforces6A--Triangle]]></title><link>https://blog.youkuaiyun.com/u010368749/article/details/21937817</link><guid>https://blog.youkuaiyun.com/u010368749/article/details/21937817</guid><author>u010368749</author><pubDate>Mon, 24 Mar 2014 10:47:34 +0800</pubDate><description><![CDATA[http://codeforces.com/problemset/problem/6/A


A. Triangle

time limit per test
2 seconds

memory limit per test
64 megabytes

input
standard input

output
standard output


Johnny h]]></description><category></category></item><item><title><![CDATA[LCS算法讲解]]></title><link>https://blog.youkuaiyun.com/u010368749/article/details/21375105</link><guid>https://blog.youkuaiyun.com/u010368749/article/details/21375105</guid><author>u010368749</author><pubDate>Mon, 17 Mar 2014 10:45:42 +0800</pubDate><description><![CDATA[首先将要看到如何运用动态编程查找两个 DNA 序列的最长公共子序列（longest common subsequence，LCS）。发现了新的基因序列的生物学家通常想知道该基因序列与其他哪个序列最相似。查找 LCS 是计算两个序列相似程度的一种方法：LCS 越长，两个序列越相似。
子序列中的字符与子字符串中的字符不同，它们不需要是连续的。例如，ACE 是 ABCDE 的子序列，但不是它的子字符串]]></description><category></category></item><item><title><![CDATA[uva111---History Grading]]></title><link>https://blog.youkuaiyun.com/u010368749/article/details/21027289</link><guid>https://blog.youkuaiyun.com/u010368749/article/details/21027289</guid><author>u010368749</author><pubDate>Tue, 11 Mar 2014 17:32:38 +0800</pubDate><description><![CDATA[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=&problem=47&mosmsg=Submission+received+with+ID+13303577



Background

Many problems in Computer S]]></description><category></category></item><item><title><![CDATA[poj3356---AGTC]]></title><link>https://blog.youkuaiyun.com/u010368749/article/details/20943105</link><guid>https://blog.youkuaiyun.com/u010368749/article/details/20943105</guid><author>u010368749</author><pubDate>Mon, 10 Mar 2014 19:19:17 +0800</pubDate><description><![CDATA[http://poj.org/problem?id=3356

Description

Let x and y be two strings over some finite alphabet A. We would like to transform
x into y allowing only operations given below:

Deletion: a lette]]></description><category></category></item><item><title><![CDATA[hdu1686--Oulipo]]></title><link>https://blog.youkuaiyun.com/u010368749/article/details/20903371</link><guid>https://blog.youkuaiyun.com/u010368749/article/details/20903371</guid><author>u010368749</author><pubDate>Mon, 10 Mar 2014 10:21:06 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1686



Problem Description
The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the]]></description><category></category></item><item><title><![CDATA[hdu1683--Colour sequence]]></title><link>https://blog.youkuaiyun.com/u010368749/article/details/20902849</link><guid>https://blog.youkuaiyun.com/u010368749/article/details/20902849</guid><author>u010368749</author><pubDate>Mon, 10 Mar 2014 10:16:06 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1683



Problem Description
We have a pile of cards consisting of 100 cards that are coloured on both sides. There is a finite number of colours (at most]]></description><category></category></item><item><title><![CDATA[最长公共上升子序列（LIS）]]></title><link>https://blog.youkuaiyun.com/u010368749/article/details/20449171</link><guid>https://blog.youkuaiyun.com/u010368749/article/details/20449171</guid><author>u010368749</author><pubDate>Tue, 04 Mar 2014 11:01:14 +0800</pubDate><description><![CDATA[最长公共上升子序列（LCIS）的O(n^2)算法
预备知识：动态规划的基本思想，LCS，LIS。 



问题：字符串a，字符串b，求a和b的LCIS（最长公共上升子序列）。 
首先我们可以看到，这个问题具有相当多的重叠子问题。于是我们想到用DP搞。DP的首要任务是什么？定义状态。

1定义状态F[i][j]表示以a串的前i个字符b串的前j个字符且以b[j]为结尾构成的LCIS的长]]></description><category></category></item><item><title><![CDATA[hdu1423---Greatest Common Increasing Subsequence(最长公共上升子序列)]]></title><link>https://blog.youkuaiyun.com/u010368749/article/details/20448943</link><guid>https://blog.youkuaiyun.com/u010368749/article/details/20448943</guid><author>u010368749</author><pubDate>Tue, 04 Mar 2014 10:53:13 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1423

Problem Description
This is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence.
 

Input
Each sequence ]]></description><category></category></item><item><title><![CDATA[hdu1080---Human Gene Functions]]></title><link>https://blog.youkuaiyun.com/u010368749/article/details/20391733</link><guid>https://blog.youkuaiyun.com/u010368749/article/details/20391733</guid><author>u010368749</author><pubDate>Mon, 03 Mar 2014 19:00:19 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1080



Problem Description
It is well known that a human gene can be considered as a sequence, consisting of four nucleotides, which are simply denoted ]]></description><category></category></item><item><title><![CDATA[uva1133---Vacation]]></title><link>https://blog.youkuaiyun.com/u010368749/article/details/20361419</link><guid>https://blog.youkuaiyun.com/u010368749/article/details/20361419</guid><author>u010368749</author><pubDate>Mon, 03 Mar 2014 10:49:26 +0800</pubDate><description><![CDATA[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=113

The Problem

You are planning to take some rest and to go out on vacation, but you really don't ]]></description><category></category></item><item><title><![CDATA[最长公共子序列]]></title><link>https://blog.youkuaiyun.com/u010368749/article/details/20228063</link><guid>https://blog.youkuaiyun.com/u010368749/article/details/20228063</guid><author>u010368749</author><pubDate>Sat, 01 Mar 2014 18:23:00 +0800</pubDate><description><![CDATA[最长公共子序列问题LCS
问题描述
参考解答

动态规划算法可有效地解此问题。下面我们按照动态规划算法设计的各个步骤来设计一个解此问题的有效算法。
1.最长公共子序列的结构

解最长公共子序列问题时最容易想到的算法是穷举搜索法，即对X的每一个子序列，检查它是否也是Y的子序列，从而确定它是否为X和Y的公共子序列，并且在检查过程中选出最长的公共子序列。X的所有子序列都检查过后即可求出X和]]></description><category></category></item><item><title><![CDATA[sdjzu---人生三大幻觉]]></title><link>https://blog.youkuaiyun.com/u010368749/article/details/20227731</link><guid>https://blog.youkuaiyun.com/u010368749/article/details/20227731</guid><author>u010368749</author><pubDate>Sat, 01 Mar 2014 18:13:09 +0800</pubDate><description><![CDATA[http://sdjzu.acmclub.com/index.php?app=problem_title&cid=1160&problem_id=A

题目描述

人生三大幻觉是手机在震动、有人叫你、还有Ta喜欢你。可是这第三条幻觉偏偏就真正的发生在了坤哥身上，坤哥很是高兴。但是......，那妹子对坤哥说了“我脖子上戴的这串项链有n个珠子，可以用c种颜色对珠子涂染，你能告诉我能形成多少种]]></description><category></category></item></channel></rss>