<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[BeanBangbang的博客]]></title><description><![CDATA[菜鸟程序员一枚]]></description><link>https://blog.youkuaiyun.com/vvmame</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; vvmame]]></copyright><item><title><![CDATA[SpringBoot项目学习路径+细节]]></title><link>https://blog.youkuaiyun.com/vvmame/article/details/88627568</link><guid>https://blog.youkuaiyun.com/vvmame/article/details/88627568</guid><author>vvmame</author><pubDate>Sun, 17 Mar 2019 21:36:02 +0800</pubDate><description><![CDATA[1.Spring Data JPA项目实战
https://blog.youkuaiyun.com/chengqiuming/article/details/82556658
2.CacheManager运行原理流程图和源码详解
https://blog.youkuaiyun.com/qq_35394891/article/details/82082491
3.RedisTemplate
https://www.cnbl...]]></description><category></category></item><item><title><![CDATA[两组有序数列的中位数]]></title><link>https://blog.youkuaiyun.com/vvmame/article/details/82389478</link><guid>https://blog.youkuaiyun.com/vvmame/article/details/82389478</guid><author>vvmame</author><pubDate>Tue, 04 Sep 2018 20:06:12 +0800</pubDate><description><![CDATA[两组升序排列的数组A[m]和B[n], 求他们的中位数。

注意，中位数的概念哦～相信你会百度一下的～

 

格式：

第一行输入数字m，接下来一行输入数组A[m], 第三行输入数字n，第四行输入数组B[n],接下来输出中位数。两个数组的长度都不超过1000。

注意，需要保留5位小数哦～所以，你设计函数的时候请设计成double类型哦～

 

样例输入


1
3
5
1 2 4 5 6

...]]></description><category></category></item><item><title><![CDATA[段有序数组查找II]]></title><link>https://blog.youkuaiyun.com/vvmame/article/details/82353743</link><guid>https://blog.youkuaiyun.com/vvmame/article/details/82353743</guid><author>vvmame</author><pubDate>Mon, 03 Sep 2018 21:12:07 +0800</pubDate><description><![CDATA[假设一个数组，事先在你未知的情况下，以某一点分段有序排列。

比如：（0,0,0,1,2,2,3 变成 0,0,1,2,2,3,0）

给定需要查找的数，在当前数组中查找，存在，返回ture，不存在，返回false.

 

注意，这次数组中有重复的数字哦～

 

格式：

第一行输入数字n，接下来一行输入数组A[n],数组A[n]满足题目描述的条件，即分段有序。如：(2, 2, 0, 0, 1...]]></description><category></category></item><item><title><![CDATA[X的平方根]]></title><link>https://blog.youkuaiyun.com/vvmame/article/details/82353711</link><guid>https://blog.youkuaiyun.com/vvmame/article/details/82353711</guid><author>vvmame</author><pubDate>Mon, 03 Sep 2018 19:47:58 +0800</pubDate><description><![CDATA[设计函数int sqrt(int x)，计算 xxx 的平方根。

输入格式

输入一个 整数 xxx，输出它的平方根。直到碰到文件结束符（EOF）为止。

输出格式

对于每组输入，输出一行一个整数，表示输入整数的平方根。

样例输入


1
2
3
4
5
6
7
8
9

样例输出


1
1
1
2
2
2
2
2
3


#include &amp;lt;iostream&amp;gt;
using n...]]></description><category></category></item><item><title><![CDATA[实战springboot踩过的坑]]></title><link>https://blog.youkuaiyun.com/vvmame/article/details/81589058</link><guid>https://blog.youkuaiyun.com/vvmame/article/details/81589058</guid><author>vvmame</author><pubDate>Sat, 11 Aug 2018 17:44:48 +0800</pubDate><description><![CDATA[

1.findBy...In:省略号中必须是实体类的字段，才能：通过（by）in在（where）查找find。



2.


repository：List&amp;lt;ProductCategory&amp;gt; findByCategoryTypeIn(List&amp;lt;Integer&amp;gt; list);


Test:List&amp;lt;Integer&amp;gt; integerList=Arrays.as...]]></description><category></category></item><item><title><![CDATA[数据库之建表--“天然气传送”]]></title><link>https://blog.youkuaiyun.com/vvmame/article/details/81037374</link><guid>https://blog.youkuaiyun.com/vvmame/article/details/81037374</guid><author>vvmame</author><pubDate>Fri, 13 Jul 2018 22:17:03 +0800</pubDate><description><![CDATA[CREATE DATABASE gap DEFAULT CHARSET utf8 COLLATE utf8_general_ci;
use gap;  
create table customer(  
	C_id int primary key AUTO_INCREMENT,  
	C_name varchar(20) NOT NULL,
	C_phone int(11) NOT NULL,
	...]]></description><category></category></item><item><title><![CDATA[多线程与并发]]></title><link>https://blog.youkuaiyun.com/vvmame/article/details/80599628</link><guid>https://blog.youkuaiyun.com/vvmame/article/details/80599628</guid><author>vvmame</author><pubDate>Wed, 06 Jun 2018 19:25:40 +0800</pubDate><description><![CDATA[//通过继承Thread类来创建线程类
public class FirstThread extends Thread
{	private int i ;
	//重写run方法，run方法的方法体就是线程执行体
	public void run()	{
		for ( ; i &amp;lt; 100 ; i++ ){System.out.println(getName() +  &quot; &quot; + i);}}	...]]></description><category></category></item><item><title><![CDATA[JAVA漫天星星之菱形]]></title><link>https://blog.youkuaiyun.com/vvmame/article/details/80207810</link><guid>https://blog.youkuaiyun.com/vvmame/article/details/80207810</guid><author>vvmame</author><pubDate>Sat, 05 May 2018 17:37:19 +0800</pubDate><description><![CDATA[输入要求：输入一个整型n（n &amp;gt; 0 &amp;amp;&amp;amp; n &amp;lt;= 30）；输出要求：在屏幕中输出（2*n+1）*（2*n+1）的图形框架，边长为n的菱形，每输出一个图形后换两行；import java.util.Scanner;
public class Main{
	public static void main(String[] args){
		Scanner input =...]]></description><category></category></item><item><title><![CDATA[排列2(next_permutation(a,a+n))]]></title><link>https://blog.youkuaiyun.com/vvmame/article/details/77113651</link><guid>https://blog.youkuaiyun.com/vvmame/article/details/77113651</guid><author>vvmame</author><pubDate>Sat, 12 Aug 2017 12:27:46 +0800</pubDate><description><![CDATA[题目链接：https://vjudge.net/contest/177033#problem/H
题意：对每组卡片按从小到大的顺序输出所有能由这四张卡片组成的4位数，千位数字相同的在同一行，同一行中每个四位数间用空格分隔
题解：从ouput看这道题要特别注意格式。不能以0做千位，确定千位后 后几位由next_permutation(a,a+4)全排列，每个数字隔开一个空格，输入与结束都隔开一行]]></description><category></category></item><item><title><![CDATA[Ananagrams]]></title><link>https://blog.youkuaiyun.com/vvmame/article/details/77103056</link><guid>https://blog.youkuaiyun.com/vvmame/article/details/77103056</guid><author>vvmame</author><pubDate>Fri, 11 Aug 2017 20:47:38 +0800</pubDate><description><![CDATA[题目链接：https://vjudge.net/contest/177033#problem/C
题意：通过字母重排，能否得到输入文本的另一单词。字母不分大小，输出时保持原字母大小，再进行字典序排序（但大写字母必须在小写字母前面）
题解：先把字母标准化，化为小写字母再排序。 然后字母重排之后只出现一次的单词，找出之后还是以字典序输出。map映射是否含有key键值，若有则放回1没有则返0
#i]]></description><category></category></item><item><title><![CDATA[Andy's First Dictionary]]></title><link>https://blog.youkuaiyun.com/vvmame/article/details/77095297</link><guid>https://blog.youkuaiyun.com/vvmame/article/details/77095297</guid><author>vvmame</author><pubDate>Fri, 11 Aug 2017 12:04:25 +0800</pubDate><description><![CDATA[题目链接：https://vjudge.net/contest/177033#problem/B
题意：给若干行字符串，提取出所有单词并去掉重复的，最后按字典顺序输出单词
题解：可以利用 STL 中的 set，找到单词即插入 set 中，则 set 自动排序这些单词，最后通过迭代器按顺序输出单词即可。
#include
#include
#include
#include
using nam]]></description><category></category></item><item><title><![CDATA[Where is the Marble?]]></title><link>https://blog.youkuaiyun.com/vvmame/article/details/77091784</link><guid>https://blog.youkuaiyun.com/vvmame/article/details/77091784</guid><author>vvmame</author><pubDate>Fri, 11 Aug 2017 10:36:50 +0800</pubDate><description><![CDATA[题目链接：https://vjudge.net/contest/177033#problem/A
题意：读入一行 N 和 Q, N 表示接下来的 N 行数字为 marbles, Q 表示 N 行数字之后的 Q 行数字为 query. 要求把 N 行 marbles 从小到大排序, 然后输出每个 Q 在 marbles 中的位置.
题解：使用qsort从小到大排列后，再逐个查找即可

#in]]></description><category></category></item><item><title><![CDATA[Connections in Galaxy War]]></title><link>https://blog.youkuaiyun.com/vvmame/article/details/77037395</link><guid>https://blog.youkuaiyun.com/vvmame/article/details/77037395</guid><author>vvmame</author><pubDate>Thu, 10 Aug 2017 10:29:24 +0800</pubDate><description><![CDATA[In order to strengthen the defense ability, many stars in galaxy allied together and built many bidirectional tunnels to exchange messages. However, when the Galaxy War began, some tunnels were destro]]></description><category></category></item><item><title><![CDATA[食物链]]></title><link>https://blog.youkuaiyun.com/vvmame/article/details/76989545</link><guid>https://blog.youkuaiyun.com/vvmame/article/details/76989545</guid><author>vvmame</author><pubDate>Wed, 09 Aug 2017 14:43:15 +0800</pubDate><description><![CDATA[动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。

现有N个动物，以1－N编号。每个动物都是A,B,C中的一种，但是我们并不知道它到底是哪一种。 
有人用两种说法对这N个动物所构成的食物链关系进行描述： 
第一种说法是"1 X Y"，表示X和Y是同类。 
第二种说法是"2 X Y"，表示X吃Y。 
此人对N个动物，用上述两种说法，一句接一句]]></description><category></category></item><item><title><![CDATA[Find them, Catch them]]></title><link>https://blog.youkuaiyun.com/vvmame/article/details/76936733</link><guid>https://blog.youkuaiyun.com/vvmame/article/details/76936733</guid><author>vvmame</author><pubDate>Tue, 08 Aug 2017 20:08:30 +0800</pubDate><description><![CDATA[The police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify which g]]></description><category></category></item><item><title><![CDATA[Farm Irrigation]]></title><link>https://blog.youkuaiyun.com/vvmame/article/details/76897409</link><guid>https://blog.youkuaiyun.com/vvmame/article/details/76897409</guid><author>vvmame</author><pubDate>Tue, 08 Aug 2017 13:17:22 +0800</pubDate><description><![CDATA[Benny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipes are placed in these squares. Different square has a different type of]]></description><category></category></item><item><title><![CDATA[More is better]]></title><link>https://blog.youkuaiyun.com/vvmame/article/details/76886560</link><guid>https://blog.youkuaiyun.com/vvmame/article/details/76886560</guid><author>vvmame</author><pubDate>Tue, 08 Aug 2017 10:30:59 +0800</pubDate><description><![CDATA[Mr Wang wants some boys to help him with a project. Because the project is rather complex,
the more boys come, the better it will be. Of course there are certain requirements.


Mr Wang selected a]]></description><category></category></item><item><title><![CDATA[并查集知识图解]]></title><link>https://blog.youkuaiyun.com/vvmame/article/details/76870609</link><guid>https://blog.youkuaiyun.com/vvmame/article/details/76870609</guid><author>vvmame</author><pubDate>Tue, 08 Aug 2017 09:33:30 +0800</pubDate><description><![CDATA[并查集学习：

1、Make_Set(x) 把每一个元素初始化为一个集合

初始化后每一个元素的父亲节点是它本身，每一个元素的祖先节点也是它本身（也可以根据情况而变）。

2、Find_Set(x) 查找一个元素所在的集合

查找一个元素所在的集合，其精髓是找到这个元素所在集合的祖先！这个才是并查集判断和合并的最终依据。
判断两个元素是否属于同一集合，只要看他们所在集合的祖先是否]]></description><category></category></item><item><title><![CDATA[The Suspects]]></title><link>https://blog.youkuaiyun.com/vvmame/article/details/76855580</link><guid>https://blog.youkuaiyun.com/vvmame/article/details/76855580</guid><author>vvmame</author><pubDate>Mon, 07 Aug 2017 19:09:40 +0800</pubDate><description><![CDATA[The Suspects

Description

Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to ot]]></description><category></category></item><item><title><![CDATA[继续畅通工程]]></title><link>https://blog.youkuaiyun.com/vvmame/article/details/76850922</link><guid>https://blog.youkuaiyun.com/vvmame/article/details/76850922</guid><author>vvmame</author><pubDate>Mon, 07 Aug 2017 16:33:30 +0800</pubDate><description><![CDATA[省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可）。现得到城镇道路统计表，表中列出了任意两城镇间修建道路的费用，以及该道路是否已经修通的状态。现请你编写程序，计算出全省畅通需要的最低成本。


Input 测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( 1< N < 100 )；随后的 N(N-1)/2]]></description><category></category></item></channel></rss>