<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[riapgypm的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/riapgypm</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; riapgypm]]></copyright><item><title><![CDATA[堆排序的实现]]></title><link>https://blog.youkuaiyun.com/riapgypm/article/details/106050897</link><guid>https://blog.youkuaiyun.com/riapgypm/article/details/106050897</guid><author>riapgypm</author><pubDate>Sun, 14 Jun 2020 17:16:21 +0800</pubDate><description><![CDATA[package com.cn.test.tree;

import java.util.Arrays;

public class HeapSortSelf {

    public static void heapSort(int[] data){
        //1、构建大顶堆
        //第一个非叶子节点的坐标 int a = data.length/2 -1
        for(int i = data.length/2-1;i&gt;=0;i--){
          ...]]></description><category></category></item><item><title><![CDATA[斐波那契查询方法]]></title><link>https://blog.youkuaiyun.com/riapgypm/article/details/105953159</link><guid>https://blog.youkuaiyun.com/riapgypm/article/details/105953159</guid><author>riapgypm</author><pubDate>Sun, 14 Jun 2020 17:15:43 +0800</pubDate><description><![CDATA[package com.cn.test.search;

import java.util.Arrays;

public class FibonacciSearch {

    private  static int maxSize = 20;

    private static int[] fib(){
        int[] f = new int[maxSize];
  ...]]></description><category></category></item><item><title><![CDATA[构建哈夫曼树]]></title><link>https://blog.youkuaiyun.com/riapgypm/article/details/106072079</link><guid>https://blog.youkuaiyun.com/riapgypm/article/details/106072079</guid><author>riapgypm</author><pubDate>Sun, 14 Jun 2020 17:14:59 +0800</pubDate><description><![CDATA[一、哈夫曼树也叫赫夫曼树，是一颗权值路径最小的二叉树。

 我们用的测试数据是 ：{6,32,15,21,3,43,69,52,39,70};

二、构建完的树如下图：



三、代码实现


package com.cn.test.tree;

import java.util.*;

public class HalfManTree {

    public static void main(String[] args) {
        //构建哈夫曼树的节点
        int[] da..]]></description><category></category></item><item><title><![CDATA[哈夫曼树完成文件的压缩和解压]]></title><link>https://blog.youkuaiyun.com/riapgypm/article/details/106104079</link><guid>https://blog.youkuaiyun.com/riapgypm/article/details/106104079</guid><author>riapgypm</author><pubDate>Sun, 14 Jun 2020 17:14:44 +0800</pubDate><description><![CDATA[1、在这里只有工具类，依赖的树节点和树的类，见另一篇博客（https://blog.youkuaiyun.com/riapgypm/article/details/106103996）里的定义

2、压缩工作类的实现如下：


package com.cn.test.tree.zip;


import java.io.*;
import java.util.*;

/**
 * 压缩工具类
 */
public class ZipFileUtil {

    public static Map&lt;Integer]]></description><category></category></item><item><title><![CDATA[哈夫曼树完成字符串的压缩和解压]]></title><link>https://blog.youkuaiyun.com/riapgypm/article/details/106103996</link><guid>https://blog.youkuaiyun.com/riapgypm/article/details/106103996</guid><author>riapgypm</author><pubDate>Sun, 14 Jun 2020 17:14:28 +0800</pubDate><description><![CDATA[1、实现的压缩工具类


package com.cn.test.tree.zip;


import java.util.*;

/**
 * 压缩工具类
 */
public class ZipUtil {

    public static Map&lt;Integer,String&gt; huffCodes = new HashMap&lt;&gt;();
    public static Map&lt;String,Integer&gt; reverseHuffCodes = new ...]]></description><category></category></item><item><title><![CDATA[基数排序的java实现]]></title><link>https://blog.youkuaiyun.com/riapgypm/article/details/105901255</link><guid>https://blog.youkuaiyun.com/riapgypm/article/details/105901255</guid><author>riapgypm</author><pubDate>Sun, 14 Jun 2020 17:13:20 +0800</pubDate><description><![CDATA[package com.cn.data.structure.linklist;

import java.util.Arrays;

public class BaseNumberSort {

    /**
     * 1、先定义10个桶，用来存储0-9的数字
     * 2、定义一个数据，存储10个桶的下标
     * @param data
     */
    publi...]]></description><category></category></item><item><title><![CDATA[逆波兰表达式java实现]]></title><link>https://blog.youkuaiyun.com/riapgypm/article/details/105790172</link><guid>https://blog.youkuaiyun.com/riapgypm/article/details/105790172</guid><author>riapgypm</author><pubDate>Sun, 14 Jun 2020 17:12:55 +0800</pubDate><description><![CDATA[package com.cn.test.algorithm;

import java.util.ArrayList;
import java.util.List;
import java.util.Stack;

public class NiBoLan {

    public List&lt;String&gt; expression2List(String expression){
 ...]]></description><category></category></item><item><title><![CDATA[八皇后遍历共有92种方式]]></title><link>https://blog.youkuaiyun.com/riapgypm/article/details/105837934</link><guid>https://blog.youkuaiyun.com/riapgypm/article/details/105837934</guid><author>riapgypm</author><pubDate>Sun, 14 Jun 2020 17:11:09 +0800</pubDate><description><![CDATA[package com.cn.test.algorithm;

public class Queue8 {

    int[][] chessboard = new int[8][8];
    int count = 0;

    public void printChessboard(){
        for (int [] one :chessboard){
        ...]]></description><category></category></item><item><title><![CDATA[jvm字节码-clinit及本地变量表]]></title><link>https://blog.youkuaiyun.com/riapgypm/article/details/105450098</link><guid>https://blog.youkuaiyun.com/riapgypm/article/details/105450098</guid><author>riapgypm</author><pubDate>Sat, 11 Apr 2020 12:33:20 +0800</pubDate><description><![CDATA[源文件如下：


public class Test {
    final static PersonReq req = new PersonReq();
    final static String helloStr = "55hello6";
    static String zhangsxan = "zhangsan";
    public static void main(Stri...]]></description><category></category></item><item><title><![CDATA[spring的mybatis整合笔记（二）]]></title><link>https://blog.youkuaiyun.com/riapgypm/article/details/105073700</link><guid>https://blog.youkuaiyun.com/riapgypm/article/details/105073700</guid><author>riapgypm</author><pubDate>Tue, 24 Mar 2020 18:27:03 +0800</pubDate><description><![CDATA[spring在和mybatis整合时，有两个主要的配置项；

一是sqlSessionFactory的配置，在这个配置里会配置数据库连接池，mapper的xml的路径，比如


    @Bean
    public SqlSessionFactoryBean sqlSessionFactory() throws Exception {
        SqlSessionFactoryBean...]]></description><category></category></item><item><title><![CDATA[spring的bean容器创建的笔记（一）]]></title><link>https://blog.youkuaiyun.com/riapgypm/article/details/105016177</link><guid>https://blog.youkuaiyun.com/riapgypm/article/details/105016177</guid><author>riapgypm</author><pubDate>Sat, 21 Mar 2020 20:09:11 +0800</pubDate><description><![CDATA[spring启动的方法


public AnnotationConfigApplicationContext(Class&lt;?&gt;... annotatedClasses) {
	this();
	register(annotatedClasses);
	refresh();
}

register方法是用来解析所有bean的定义信息。

refresh方法完成了容器的创建与刷新工作，看...]]></description><category></category></item><item><title><![CDATA[java线程池的原理（一）]]></title><link>https://blog.youkuaiyun.com/riapgypm/article/details/104986833</link><guid>https://blog.youkuaiyun.com/riapgypm/article/details/104986833</guid><author>riapgypm</author><pubDate>Fri, 20 Mar 2020 13:07:45 +0800</pubDate><description><![CDATA[java在1.5之后，提供了线程池ThreadPoolExecutor和工具类Executors。

 但是一般不建议用Executors，因为在线程池里有一个workQueue(在使用newFixedThreadPool和newSingleThreadExecutor创建线程池时用的是LinkedBlockingQueue)队列，是用来存储等待线程的任务。在使用Executors创建...]]></description><category></category></item><item><title><![CDATA[Thread.interrupted影响]]></title><link>https://blog.youkuaiyun.com/riapgypm/article/details/104901221</link><guid>https://blog.youkuaiyun.com/riapgypm/article/details/104901221</guid><author>riapgypm</author><pubDate>Mon, 16 Mar 2020 16:10:18 +0800</pubDate><description><![CDATA[可以从不少博客中，可以得知Thread.interrupted(),可以清除当前线程的中断标志位，但是不知道清除之后有什么影响，

今天测试了下，中断标志位，就是一个线程是否要中断的标志。但是有以下规则

    当线程正在执行时，线程被中断了，线程还会继续执行，不会中断，当线程在执行过程中遇到了wait()、sleep()、或者被其它线程join()时，才会处理中断，抛...]]></description><category></category></item><item><title><![CDATA[httpclient连接池是否能真的提高性能]]></title><link>https://blog.youkuaiyun.com/riapgypm/article/details/84137656</link><guid>https://blog.youkuaiyun.com/riapgypm/article/details/84137656</guid><author>riapgypm</author><pubDate>Fri, 16 Nov 2018 13:42:17 +0800</pubDate><description><![CDATA[用的是httpclient的类CloseableHttpClient，在用户请求完一次之后，没有关闭，紧接着请求第二次，是否就不需要重建建立连接了，这个不一定，分两种情况

1）、假设服务器端设置的连接的keepAliveTimeout，超时为1分钟，第一次请求完停了超过1分钟，再进行第二次请求，这时会重新建立新的连接。

如下图在超过1分钟之后，就已经被服务器端主动关闭了，



请求第二次的时...]]></description><category></category></item><item><title><![CDATA[Hashmap源码的收获]]></title><link>https://blog.youkuaiyun.com/riapgypm/article/details/81111872</link><guid>https://blog.youkuaiyun.com/riapgypm/article/details/81111872</guid><author>riapgypm</author><pubDate>Thu, 19 Jul 2018 11:12:33 +0800</pubDate><description><![CDATA[1、threshold：扩容阀值。这个变量有两个作用：

      1）、计算hashmap的初始容量。hashmap的默认初始容量是16，假如你设定了一个初始容量X，hashmap不用采用你设置的初始容量，而是会根据你设置的值进行一次计算，计算的方法如下：
     


    /**
     * Returns a power of two size for the given targ...]]></description><category></category></item><item><title><![CDATA[Excel导入大数据量]]></title><link>https://blog.youkuaiyun.com/riapgypm/article/details/78796710</link><guid>https://blog.youkuaiyun.com/riapgypm/article/details/78796710</guid><author>riapgypm</author><pubDate>Wed, 13 Dec 2017 21:11:03 +0800</pubDate><description><![CDATA[之前写过一篇关于如何导出大数据的博客，最近因为工作需要，又有导入的需求。网上查了很多资料，后来发现POI提供了解决方案，大致思路是，excel2007之后，其实是由xml组成的，把excel的扩展名改成zip,再解压，就能看到里面的xml。主要有两类xml，一类是存储常量的xml，名字叫 shareStrings.xml，大至如下：




  
    类型
  
  
    数量]]></description><category></category></item><item><title><![CDATA[算法之最大子数组]]></title><link>https://blog.youkuaiyun.com/riapgypm/article/details/78321552</link><guid>https://blog.youkuaiyun.com/riapgypm/article/details/78321552</guid><author>riapgypm</author><pubDate>Mon, 23 Oct 2017 18:09:34 +0800</pubDate><description><![CDATA[用了两种方式来实现最大子数组法，一种是递归的分治法，另一种非递归的线性法。]]></description><category></category></item><item><title><![CDATA[排序算法之归并排序]]></title><link>https://blog.youkuaiyun.com/riapgypm/article/details/78204241</link><guid>https://blog.youkuaiyun.com/riapgypm/article/details/78204241</guid><author>riapgypm</author><pubDate>Wed, 11 Oct 2017 15:29:15 +0800</pubDate><description><![CDATA[归并排序：采用分治策略的一种排序算法，先把要排序的数组分成两个有序的序列，然后再比较两个有序序列的最小值进行排序。排序的时间复杂度是O（nlgn）。
下面是用java实现的代码


/**
 * 归并排序
 *
 */
public class MergeSort {
	
	//两个有序数组的归并
	public void merge(Integer begin,Integer end,I]]></description><category></category></item><item><title><![CDATA[java 用户自定义的父类转换成子类的方法]]></title><link>https://blog.youkuaiyun.com/riapgypm/article/details/73603275</link><guid>https://blog.youkuaiyun.com/riapgypm/article/details/73603275</guid><author>riapgypm</author><pubDate>Thu, 22 Jun 2017 13:28:47 +0800</pubDate><description><![CDATA[在工作中，一般是实体类对应的数据库表，另外再定义一个Model继承实体类，在model里往往添加一些辅助的属性。我们从数据库查出的数据放在实体类里，但是展现数据时需要用到model类，这时就需要把实体类转换成Model类。父类不可能强制转换成子类，所以写了一个通用的方法，适用于这种场景下的转换，代码如下：
    /**
     * 通过public的 get set方法进行复制，适合用于父类]]></description><category></category></item><item><title><![CDATA[excel转html]]></title><link>https://blog.youkuaiyun.com/riapgypm/article/details/53929737</link><guid>https://blog.youkuaiyun.com/riapgypm/article/details/53929737</guid><author>riapgypm</author><pubDate>Thu, 29 Dec 2016 16:32:06 +0800</pubDate><description><![CDATA[poi提供了excel转html的代码，但是吧，有好多问题。当有合并单元格时边框获取不到，单元格内的字体样式也转换不了，现在对poi提供的Tohtml.java做了一些修改，修复了这些问题，记录下，以备之后用到]]></description><category></category></item></channel></rss>