<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[u014241071的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/u014241071</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u014241071]]></copyright><item><title><![CDATA[导数 切线的斜率]]></title><link>https://blog.youkuaiyun.com/u014241071/article/details/82713350</link><guid>https://blog.youkuaiyun.com/u014241071/article/details/82713350</guid><author>u014241071</author><pubDate>Sat, 15 Sep 2018 13:54:53 +0800</pubDate><description><![CDATA[导数 =切线的斜率]]></description><category></category></item><item><title><![CDATA[桶排序]]></title><link>https://blog.youkuaiyun.com/u014241071/article/details/81777700</link><guid>https://blog.youkuaiyun.com/u014241071/article/details/81777700</guid><author>u014241071</author><pubDate>Fri, 17 Aug 2018 14:59:55 +0800</pubDate><description><![CDATA[https://blog.youkuaiyun.com/mupengfei6688/article/details/53106267]]></description><category></category></item><item><title><![CDATA[插入排序算法]]></title><link>https://blog.youkuaiyun.com/u014241071/article/details/81706903</link><guid>https://blog.youkuaiyun.com/u014241071/article/details/81706903</guid><author>u014241071</author><pubDate>Wed, 15 Aug 2018 16:43:51 +0800</pubDate><description><![CDATA[https://www.cnblogs.com/Hua-Min/p/StraightInsertionSort.html]]></description><category></category></item><item><title><![CDATA[归并排序]]></title><link>https://blog.youkuaiyun.com/u014241071/article/details/81706633</link><guid>https://blog.youkuaiyun.com/u014241071/article/details/81706633</guid><author>u014241071</author><pubDate>Wed, 15 Aug 2018 16:34:42 +0800</pubDate><description><![CDATA[转载 
https://www.cnblogs.com/chengxiao/p/6194356.html


基本思想
　　归并排序（MERGE-SORT）是利用归并的思想实现的排序方法，该算法采用经典的分治（divide-and-conquer）策略（分治法将问题分(divide)成一些小的问题然后递归求解，而治(conquer)的阶段则将分的阶段得到的各答案”修补”在一起，即分而治之)。
分而...]]></description><category></category></item><item><title><![CDATA[算法]]></title><link>https://blog.youkuaiyun.com/u014241071/article/details/81706548</link><guid>https://blog.youkuaiyun.com/u014241071/article/details/81706548</guid><author>u014241071</author><pubDate>Wed, 15 Aug 2018 16:31:35 +0800</pubDate><description><![CDATA[选择排序

归并排序]]></description><category></category></item><item><title><![CDATA[堆排序]]></title><link>https://blog.youkuaiyun.com/u014241071/article/details/81706198</link><guid>https://blog.youkuaiyun.com/u014241071/article/details/81706198</guid><author>u014241071</author><pubDate>Wed, 15 Aug 2018 16:18:15 +0800</pubDate><description><![CDATA[https://blog.youkuaiyun.com/l577217/article/details/80516654 
https://www.cnblogs.com/chengxiao/p/6129630.html]]></description><category></category></item><item><title><![CDATA[maven]]></title><link>https://blog.youkuaiyun.com/u014241071/article/details/81668908</link><guid>https://blog.youkuaiyun.com/u014241071/article/details/81668908</guid><author>u014241071</author><pubDate>Tue, 14 Aug 2018 16:04:02 +0800</pubDate><description><![CDATA[http://maven.apache.org/guides/introduction/introduction-to-plugin-prefix-mapping.html]]></description><category></category></item><item><title><![CDATA[Maven中的几个重要概念：lifecycle, phase and goal]]></title><link>https://blog.youkuaiyun.com/u014241071/article/details/81668312</link><guid>https://blog.youkuaiyun.com/u014241071/article/details/81668312</guid><author>u014241071</author><pubDate>Tue, 14 Aug 2018 15:42:02 +0800</pubDate><description><![CDATA[
                    
                        

原文：http://maven.apache.org/guides/introduction/introduction-to-the-lifecycle.html

当我们在使用Maven做一些工作，如打包，编译，运行测试等等任务时，我们已经使用到了Maven中的几个重要概念：
lifecycle, p...]]></description><category></category></item><item><title><![CDATA[java jdk 版本不一致 环境变量]]></title><link>https://blog.youkuaiyun.com/u014241071/article/details/81668114</link><guid>https://blog.youkuaiyun.com/u014241071/article/details/81668114</guid><author>u014241071</author><pubDate>Tue, 14 Aug 2018 15:33:49 +0800</pubDate><description><![CDATA[1 . 准备两个版本的jdk我的两个jdk路径为： 
D:\jdk1.7.0_80 
D:\Program Files\Java\jdk1.8.0_11112 
2 . 设置两个子JAVA_HOME，一个总设置两个子JAVA_HOME: 
JAVA_HOME7 = D:\jdk1.7.0_80 
JAVA_HOME8 = D:\Program Files\Java\jdk1.8.0_11112 
...]]></description><category></category></item><item><title><![CDATA[maven 交互模式]]></title><link>https://blog.youkuaiyun.com/u014241071/article/details/81663930</link><guid>https://blog.youkuaiyun.com/u014241071/article/details/81663930</guid><author>u014241071</author><pubDate>Tue, 14 Aug 2018 11:29:44 +0800</pubDate><description><![CDATA[转载 
https://www.cnblogs.com/shengs/p/5517216.html

创建 Maven 项目 
我们不妨创建一个 Java Web 项目，只需在 cmd 中输入：

mvn archetype:generate

随后 Maven 将下载 Archetype 插件及其所有的依赖插件，这些插件其实都是 jar 包，它们存放在您的 Maven 本地仓库中。

在 cmd...]]></description><category></category></item><item><title><![CDATA[maven 中的三种工程]]></title><link>https://blog.youkuaiyun.com/u014241071/article/details/81663672</link><guid>https://blog.youkuaiyun.com/u014241071/article/details/81663672</guid><author>u014241071</author><pubDate>Tue, 14 Aug 2018 11:20:25 +0800</pubDate><description><![CDATA[转载 
https://blog.youkuaiyun.com/tb9127/article/details/78787814


                    
                        

maven中的三种工程：
1.pom工程：用在父级工程或聚合工程中。用来做jar包的版本控制。
2.war工程：将会打包成war，发布在服务器上的工程。如网站或服务。
3.jar工程：将...]]></description><category></category></item><item><title><![CDATA[递归]]></title><link>https://blog.youkuaiyun.com/u014241071/article/details/81663239</link><guid>https://blog.youkuaiyun.com/u014241071/article/details/81663239</guid><author>u014241071</author><pubDate>Tue, 14 Aug 2018 11:04:02 +0800</pubDate><description><![CDATA[递归思想：

递归就是方法里调用自身方法]]></description><category></category></item><item><title><![CDATA[linux vi vim 输入模式 i 键 insert键]]></title><link>https://blog.youkuaiyun.com/u014241071/article/details/81629801</link><guid>https://blog.youkuaiyun.com/u014241071/article/details/81629801</guid><author>u014241071</author><pubDate>Mon, 13 Aug 2018 14:46:42 +0800</pubDate><description><![CDATA[打开VIM之后，按一下insert键或者i键就可以进入输入状态了]]></description><category></category></item><item><title><![CDATA[Linux vi vim 宏 批量操作 重复操作 宏录制]]></title><link>https://blog.youkuaiyun.com/u014241071/article/details/81629367</link><guid>https://blog.youkuaiyun.com/u014241071/article/details/81629367</guid><author>u014241071</author><pubDate>Mon, 13 Aug 2018 14:27:03 +0800</pubDate><description><![CDATA[转载 
https://www.cnblogs.com/ini_always/archive/2011/09/21/2184446.html

在编辑某个文件的时候，可能会出现需要对某种特定的操作进行许多次的情况，以编辑下面的文件为例：


;==============================================================================...]]></description><category></category></item><item><title><![CDATA[翻译  getting the most out of]]></title><link>https://blog.youkuaiyun.com/u014241071/article/details/81626655</link><guid>https://blog.youkuaiyun.com/u014241071/article/details/81626655</guid><author>u014241071</author><pubDate>Mon, 13 Aug 2018 11:17:36 +0800</pubDate><description><![CDATA[get the most out of 
英[ɡet ðə məust aut ɔv]美[ɡɛt ði most aʊt ʌv] 
释义 
最有效的使用，发挥…的最大功效

are intended to 
的目的是

来源：

The sections in this sample file are intended to give you a running start at getting ...]]></description><category></category></item><item><title><![CDATA[[排序算法]--冒泡排序的三种实现(Java)]]></title><link>https://blog.youkuaiyun.com/u014241071/article/details/81566465</link><guid>https://blog.youkuaiyun.com/u014241071/article/details/81566465</guid><author>u014241071</author><pubDate>Fri, 10 Aug 2018 17:02:03 +0800</pubDate><description><![CDATA[转自 https://blog.youkuaiyun.com/u010853261/article/details/54891710


                    
                
  冒泡排序是非常好理解的，以从小到大排序为例，每一轮排序就找出未排序序列中最大值放在最后。


设数组的长度为N： 
（1）比较前后相邻的二个数据，如果前面数据大于后面的数据，就将这二个数据交换。...]]></description><category></category></item><item><title><![CDATA[快速排序——JAVA实现（图文并茂）]]></title><link>https://blog.youkuaiyun.com/u014241071/article/details/81565148</link><guid>https://blog.youkuaiyun.com/u014241071/article/details/81565148</guid><author>u014241071</author><pubDate>Fri, 10 Aug 2018 16:07:23 +0800</pubDate><description><![CDATA[
                    
                高快省的排序算法

有没有既不浪费空间又可以快一点的排序算法呢？那就是“快速排序”啦！光听这个名字是不是就觉得很高端呢。

假设我们现在对“6  1  2 7  9  3  4  5 10  8”这个10个数进行排序。首先在这个序列中随便找一个数作为基准数（不要被这个名词吓到了，就是一个用来参照的数，待会你就知道它用来做啥...]]></description><category></category></item><item><title><![CDATA[磁盘、分区及Linux文件系统 [Disk, Partition, Linux File System]]]></title><link>https://blog.youkuaiyun.com/u014241071/article/details/81562442</link><guid>https://blog.youkuaiyun.com/u014241071/article/details/81562442</guid><author>u014241071</author><pubDate>Fri, 10 Aug 2018 14:12:55 +0800</pubDate><description><![CDATA[

1、磁盘基础知识&amp;nbsp;




1.1 物理结构
硬盘的物理结构一般由磁头与碟片、电动机、主控芯片与排线等部件组成；当主电动机带动碟片旋转时，副电动机带动一组（磁头）到相对应的碟片上并确定读取正面还是反面的碟面，磁头悬浮在碟面上画出一个与碟片同心的圆形轨道（磁轨或称柱面），这时由磁头的磁感线圈感应碟面上的磁性与使用硬盘厂商指定的读取时间或数据间隔定位扇区，从而得到该扇区的数据内容。所有的...]]></description><category></category></item><item><title><![CDATA[java JDK JRE JVM 区别  关系]]></title><link>https://blog.youkuaiyun.com/u014241071/article/details/81559503</link><guid>https://blog.youkuaiyun.com/u014241071/article/details/81559503</guid><author>u014241071</author><pubDate>Fri, 10 Aug 2018 10:53:07 +0800</pubDate><description><![CDATA[

JDK、JRE、JVM有什么区别？有什么关系? 
https://jingyan.baidu.com/article/425e69e6077283be15fc16ed.html]]></description><category></category></item><item><title><![CDATA[java实现二分查找-两种方式]]></title><link>https://blog.youkuaiyun.com/u014241071/article/details/81541144</link><guid>https://blog.youkuaiyun.com/u014241071/article/details/81541144</guid><author>u014241071</author><pubDate>Thu, 09 Aug 2018 17:36:47 +0800</pubDate><description><![CDATA[https://blog.youkuaiyun.com/maoyuanming0806/article/details/78176957]]></description><category></category></item></channel></rss>