<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Reboot]]></title><description><![CDATA[每天迈出一小步，人生就迈进一大步]]></description><link>https://blog.youkuaiyun.com/axwolfer</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; axwolfer]]></copyright><item><title><![CDATA[Prim算法java实现]]></title><link>https://blog.youkuaiyun.com/axwolfer/article/details/105910728</link><guid>https://blog.youkuaiyun.com/axwolfer/article/details/105910728</guid><author>axwolfer</author><pubDate>Mon, 04 May 2020 10:57:26 +0800</pubDate><description><![CDATA[原理简单介绍：

1).输入：一个加权连通图，其中顶点集合为V，边集合为E；

2).初始化：Vertex数组，Vertex作为定点，包含其索引，父节点索引，其与已构建的最小生成树中存在的边中最小权值weight，根节点的权重初始为0； 将所有的Vertex加入到一个优先级队列

3).重复下列操作，直到优先级队列为空：

a.在优先级队列里取出最小权值的节点u，将u加入到最小生成树中，并记录u到...]]></description><category></category></item><item><title><![CDATA[kruskal java实现，采用按高度求并]]></title><link>https://blog.youkuaiyun.com/axwolfer/article/details/105907549</link><guid>https://blog.youkuaiyun.com/axwolfer/article/details/105907549</guid><author>axwolfer</author><pubDate>Sun, 03 May 2020 19:32:46 +0800</pubDate><description><![CDATA[public class Kruskal {
    public static void main(String[] args) {
        int[][] edges = {
                {0, 1, 6},
                {0, 2, 1},
                {0, 3, 5},
                {2, 1, 5...]]></description><category></category></item><item><title><![CDATA[树莓派写入SD卡时在内存卡格式化之后仍然不能写入.img文件提示 Error 5:拒绝访问的解决办法]]></title><link>https://blog.youkuaiyun.com/axwolfer/article/details/104909576</link><guid>https://blog.youkuaiyun.com/axwolfer/article/details/104909576</guid><author>axwolfer</author><pubDate>Mon, 16 Mar 2020 22:02:58 +0800</pubDate><description><![CDATA[原文地址：https://segmentfault.com/a/1190000016593468



注：一定要认认真真的选择磁盘（根据其大小选择）删错了, 就废了！！！！！！！！！！！！！！！！！

使用工具win32DiskImager将官网下载的2018-06-27-raspbian-stretch.img写入树莓派的内存卡中
然后......

由于假装无事, So我就不列举我...]]></description><category></category></item><item><title><![CDATA[【Appium】Original error: Could not find 'adb.exe' in PATH. 解决办法]]></title><link>https://blog.youkuaiyun.com/axwolfer/article/details/104889350</link><guid>https://blog.youkuaiyun.com/axwolfer/article/details/104889350</guid><author>axwolfer</author><pubDate>Sun, 15 Mar 2020 23:24:55 +0800</pubDate><description><![CDATA[通过客户端访问Appium服务端时，提示：Original error: Could not find 'adb.exe' in PATH. 让检查ANDROID_HOME是否正确配置。

DesiredCapabilities capabilities = new DesiredCapabilities();
    capabilities.setCapability(Capabili...]]></description><category></category></item><item><title><![CDATA[【学习笔记】leetcode1203]]></title><link>https://blog.youkuaiyun.com/axwolfer/article/details/104403044</link><guid>https://blog.youkuaiyun.com/axwolfer/article/details/104403044</guid><author>axwolfer</author><pubDate>Wed, 19 Feb 2020 23:27:35 +0800</pubDate><description><![CDATA[public class Solution {
    int groupNumx = 0;
    int[] itemIndegree = null;
    int[] groupIndegree = null;
    Item[] items = null;
    Group[] groups = null;

    public int[] sortItems(int n,...]]></description><category></category></item><item><title><![CDATA[【学习笔记】Java 类加载器学习笔记]]></title><link>https://blog.youkuaiyun.com/axwolfer/article/details/104228438</link><guid>https://blog.youkuaiyun.com/axwolfer/article/details/104228438</guid><author>axwolfer</author><pubDate>Sat, 08 Feb 2020 22:03:05 +0800</pubDate><description><![CDATA[测试项目中，有这样一个需求：

一套自动化测试调度体系，调度多种形态的产品测试，比如App，Rest接口等

希望通过这样的方式实现：

在自动化测试系统里定义统一的接口，每一种形态的测试模块实现统一的接口，打成单独的jar包，然后动态加载到框架中。

为了实现这个功能，需要用到自定义的类加载器，同时了解类加载器的双亲委派模型及破坏。

关于类加载器建议阅读《深入理解Java虚拟机》的第7章和第9...]]></description><category></category></item><item><title><![CDATA[Windows 8 下OpenJDK源码下载]]></title><link>https://blog.youkuaiyun.com/axwolfer/article/details/104211614</link><guid>https://blog.youkuaiyun.com/axwolfer/article/details/104211614</guid><author>axwolfer</author><pubDate>Fri, 07 Feb 2020 16:23:25 +0800</pubDate><description><![CDATA[1、下载Tortoisehg

下载地址：http://www.download82.com/download/windows/tortoisehg/

2、下载后双击安装即可

3、获取源代码项目地址

http://hg.openjdk.java.net/jdk8u

也可以直接下载源码包：https://download.java.net/openjdk/jdk8/promoted/b132...]]></description><category></category></item><item><title><![CDATA[【学习笔记】leetcode 65 有效数字 DFA解法]]></title><link>https://blog.youkuaiyun.com/axwolfer/article/details/104128274</link><guid>https://blog.youkuaiyun.com/axwolfer/article/details/104128274</guid><author>axwolfer</author><pubDate>Fri, 31 Jan 2020 21:24:44 +0800</pubDate><description><![CDATA[https://leetcode-cn.com/problems/valid-number/submissions/

验证给定的字符串是否可以解释为十进制数字。

例如:

"0"=&gt;true
" 0.1 "=&gt;true
"abc"=&gt;false
"1 a"=&gt;false
"2e10"=&gt;true
" -90e3"=&gt;true
"...]]></description><category></category></item><item><title><![CDATA[[学习笔记] leetcode 843. 猜猜这个单词]]></title><link>https://blog.youkuaiyun.com/axwolfer/article/details/103866417</link><guid>https://blog.youkuaiyun.com/axwolfer/article/details/103866417</guid><author>axwolfer</author><pubDate>Mon, 06 Jan 2020 23:01:27 +0800</pubDate><description><![CDATA[import java.util.ArrayList;
import java.util.List;

public class Solution {
    int[][] H; // H[i][j]表示第i个和第j个字符串相同字母&amp;位置的个数

    public void findSecretWord(String[] wordlist, Master master) {
   ...]]></description><category></category></item><item><title><![CDATA[【leetcode 1124. 表现良好的最长时间段】练题笔记]]></title><link>https://blog.youkuaiyun.com/axwolfer/article/details/103796428</link><guid>https://blog.youkuaiyun.com/axwolfer/article/details/103796428</guid><author>axwolfer</author><pubDate>Wed, 01 Jan 2020 21:44:33 +0800</pubDate><description><![CDATA[https://leetcode-cn.com/problems/longest-well-performing-interval/submissions/

1、暴力算法：


public int longestWPI(int[] hours) {
        int[] sums = new int[10000];
        Arrays.fill(sums, 0);
      ...]]></description><category></category></item><item><title><![CDATA[【Spring Boot JPA】ManyToOne OneToMany学习笔记]]></title><link>https://blog.youkuaiyun.com/axwolfer/article/details/100822145</link><guid>https://blog.youkuaiyun.com/axwolfer/article/details/100822145</guid><author>axwolfer</author><pubDate>Sat, 14 Sep 2019 09:49:34 +0800</pubDate><description><![CDATA[Spring Data JPA的官方文档参考：https://docs.spring.io/spring-data/jpa/docs/current/reference/html/

我希望使用JPA进行两个表的一对多和多对一的关系：

相册（Album）1 : N相片（Photo）

Album的定义为：


import com.fasterxml.jackson.annotation.Js...]]></description><category></category></item><item><title><![CDATA[【学习笔记】快速判断一个数是不是2的n次方]]></title><link>https://blog.youkuaiyun.com/axwolfer/article/details/100751412</link><guid>https://blog.youkuaiyun.com/axwolfer/article/details/100751412</guid><author>axwolfer</author><pubDate>Wed, 11 Sep 2019 22:29:12 +0800</pubDate><description><![CDATA[公式是： n &amp; ( n - 1)， 如果等于0，说明是，否则，说明不是

原理是：2的n次方的数，转换成2进制只有最高位是1，其他低位都是0，必然：2的二进制是10,4的二进制是100,8的二进制是1000

对n-1后，需要从高位借1，高位变0，低位全变1，比如1的二进制是1， 3的二进制是11， 7的二进制是111

做与操作以后，如果是2的n次方，则结果为0


...]]></description><category></category></item><item><title><![CDATA[2020年应届生校招技术面试随笔]]></title><link>https://blog.youkuaiyun.com/axwolfer/article/details/100746656</link><guid>https://blog.youkuaiyun.com/axwolfer/article/details/100746656</guid><author>axwolfer</author><pubDate>Wed, 11 Sep 2019 19:58:17 +0800</pubDate><description><![CDATA[2019年应届生校招技面随笔

每一年都有新形势，今年也不例外，今年的要求是：重质量，不要求数量。随之而来的，就是面试流程的变更，最重要的就是你之前找人在网上替考不管用了，现场要重新笔试。以下是我个人的几点建议：

1、技术面试的时候，会围绕你做的项目或你或的奖项来考察，会要求你介绍项目或奖项，然后根据你讲的情况进行发散，建议大家关注几点：

（1）项目的背景、意义和价值，它用来解决什么问题...]]></description><category></category></item><item><title><![CDATA[【力扣】最长回文子串https://leetcode-cn.com/problems/longest-palindromic-substring]]></title><link>https://blog.youkuaiyun.com/axwolfer/article/details/100549379</link><guid>https://blog.youkuaiyun.com/axwolfer/article/details/100549379</guid><author>axwolfer</author><pubDate>Wed, 04 Sep 2019 23:21:32 +0800</pubDate><description><![CDATA[public String longestPalindrome(String s) {
        if (s == null) {
            return "";
        }
        int len = s.length();
        // 长度为0或长度为1直接返回
        if (len == 0 || len == 1) {
      ...]]></description><category></category></item><item><title><![CDATA[【力扣】两数相加 https://leetcode-cn.com/problems/add-two-numbers/]]></title><link>https://blog.youkuaiyun.com/axwolfer/article/details/100178986</link><guid>https://blog.youkuaiyun.com/axwolfer/article/details/100178986</guid><author>axwolfer</author><pubDate>Sun, 01 Sep 2019 00:04:37 +0800</pubDate><description><![CDATA[https://leetcode-cn.com/problems/add-two-numbers/


/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
...]]></description><category></category></item><item><title><![CDATA[【学习笔记】Spring Boot 2.0 HTTP2 demo]]></title><link>https://blog.youkuaiyun.com/axwolfer/article/details/93315333</link><guid>https://blog.youkuaiyun.com/axwolfer/article/details/93315333</guid><author>axwolfer</author><pubDate>Sat, 22 Jun 2019 12:43:15 +0800</pubDate><description><![CDATA[1、切换JDK

本机当前的JDK是1.8，由于使用HTTP2的话，需要高于JDK1.9的版本，故先切换到JDK11。

首先删除环境变量中的ClassPath

修改JAVA_HOME，指向新的JDK路径

理论上上面两步就OK了，但是在使用Java -version查询版本时仍然显式1.8。排查后发现在Path环境变量中有一个C:\Program Files (x86)\Common File...]]></description><category></category></item><item><title><![CDATA[Eclipse+Maven+JUnit时The import org.junit cannot be   resolved]]></title><link>https://blog.youkuaiyun.com/axwolfer/article/details/89716609</link><guid>https://blog.youkuaiyun.com/axwolfer/article/details/89716609</guid><author>axwolfer</author><pubDate>Tue, 30 Apr 2019 22:55:17 +0800</pubDate><description><![CDATA[开始学习JUnit,按官网的操作:https://github.com/junit-team/junit4/wiki/Download-and-Install

在Eclipse里配置了Maven:

&lt;dependencies&gt;
  &lt;dependency&gt;
   &lt;groupId&gt;junit&lt;/groupId&gt;
   &lt;ar...]]></description><category></category></item><item><title><![CDATA[Linux安装GCC方法（转载+补充）]]></title><link>https://blog.youkuaiyun.com/axwolfer/article/details/88753013</link><guid>https://blog.youkuaiyun.com/axwolfer/article/details/88753013</guid><author>axwolfer</author><pubDate>Fri, 22 Mar 2019 23:10:24 +0800</pubDate><description><![CDATA[出处：https://www.cnblogs.com/yadongliang/p/6100003.html

一.安装

yum -y install gcc gcc-c++ autoconf pcre pcre-devel make automake
yum -y install wget httpd-tools vim

1.就把gcc当成c语言编译器, g++当成c++语言编译器用就是了.(...]]></description><category></category></item><item><title><![CDATA[【转】详解C程序编译、链接与存储空间布局]]></title><link>https://blog.youkuaiyun.com/axwolfer/article/details/86709153</link><guid>https://blog.youkuaiyun.com/axwolfer/article/details/86709153</guid><author>axwolfer</author><pubDate>Wed, 30 Jan 2019 22:06:14 +0800</pubDate><description><![CDATA[原文地址：https://www.cnblogs.com/33debug/p/6545136.html

被隐藏了的过程

　　现如今在流行的集成开发环境下我们很少需要关注编译和链接的过程，而隐藏在程序运行期间的细节过程可不简单，即使使用命令行来编译一个源代码文件，简单的一句&quot;gcc hello.c&quot;命令就包含了非常复杂的过程。


1 #include&amp;lt;stdio.h&amp;gt; 
3 int...]]></description><category></category></item><item><title><![CDATA[Eclipse下使用JNI调用C]]></title><link>https://blog.youkuaiyun.com/axwolfer/article/details/86585325</link><guid>https://blog.youkuaiyun.com/axwolfer/article/details/86585325</guid><author>axwolfer</author><pubDate>Mon, 21 Jan 2019 22:57:20 +0800</pubDate><description><![CDATA[本文采用的配套软件版本：

Windows 10 64位

Eclipse Version: 2018-09 (4.9.0)

jdk-8u191

tdm64-gcc-5.1.0-2 官网地址：http://tdm-gcc.tdragon.net/download （下载地址：https://download.youkuaiyun.com/download/axwolfer/10931095）

Eclip...]]></description><category></category></item></channel></rss>