<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[匆匆那年]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/guokeyan22</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; guokeyan22]]></copyright><item><title><![CDATA[Spring框架总结]]></title><link>https://blog.youkuaiyun.com/guokeyan22/article/details/77917157</link><guid>https://blog.youkuaiyun.com/guokeyan22/article/details/77917157</guid><author>guokeyan22</author><pubDate>Sat, 09 Sep 2017 19:10:01 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[VXLAN技术详解]]></title><link>https://blog.youkuaiyun.com/guokeyan22/article/details/77848037</link><guid>https://blog.youkuaiyun.com/guokeyan22/article/details/77848037</guid><author>guokeyan22</author><pubDate>Tue, 05 Sep 2017 10:04:16 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[DISC性格测试]]></title><link>https://blog.youkuaiyun.com/guokeyan22/article/details/77752477</link><guid>https://blog.youkuaiyun.com/guokeyan22/article/details/77752477</guid><author>guokeyan22</author><pubDate>Thu, 31 Aug 2017 20:25:57 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[随机密码生成]]></title><link>https://blog.youkuaiyun.com/guokeyan22/article/details/77750924</link><guid>https://blog.youkuaiyun.com/guokeyan22/article/details/77750924</guid><author>guokeyan22</author><pubDate>Thu, 31 Aug 2017 18:37:14 +0800</pubDate><description><![CDATA[编写一个函数，用于生成随机密码，入参为随机密码的长度，出参为生成的随机密码，要求生成的随机密码必须同时包含大写字母小写字母数字。


V1:
import java.util.Random;

public class Main {
    public static void main(String[] args) {
        while (true)
            S]]></description><category></category></item><item><title><![CDATA[SNMP 原理详解]]></title><link>https://blog.youkuaiyun.com/guokeyan22/article/details/77747897</link><guid>https://blog.youkuaiyun.com/guokeyan22/article/details/77747897</guid><author>guokeyan22</author><pubDate>Thu, 31 Aug 2017 15:50:57 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[数据库事务的隔离级别]]></title><link>https://blog.youkuaiyun.com/guokeyan22/article/details/77717156</link><guid>https://blog.youkuaiyun.com/guokeyan22/article/details/77717156</guid><author>guokeyan22</author><pubDate>Wed, 30 Aug 2017 15:33:28 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[机器学习相关——协同过滤]]></title><link>https://blog.youkuaiyun.com/guokeyan22/article/details/75578950</link><guid>https://blog.youkuaiyun.com/guokeyan22/article/details/75578950</guid><author>guokeyan22</author><pubDate>Thu, 20 Jul 2017 22:41:22 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[推荐系统的常用算法概述]]></title><link>https://blog.youkuaiyun.com/guokeyan22/article/details/75578877</link><guid>https://blog.youkuaiyun.com/guokeyan22/article/details/75578877</guid><author>guokeyan22</author><pubDate>Thu, 20 Jul 2017 22:35:49 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[离散傅里叶变换的复数基础]]></title><link>https://blog.youkuaiyun.com/guokeyan22/article/details/70767680</link><guid>https://blog.youkuaiyun.com/guokeyan22/article/details/70767680</guid><author>guokeyan22</author><pubDate>Tue, 25 Apr 2017 21:41:57 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[奇异值分解SVD]]></title><link>https://blog.youkuaiyun.com/guokeyan22/article/details/70228063</link><guid>https://blog.youkuaiyun.com/guokeyan22/article/details/70228063</guid><author>guokeyan22</author><pubDate>Tue, 18 Apr 2017 14:27:48 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[泊松分布和指数分布：10分钟教程]]></title><link>https://blog.youkuaiyun.com/guokeyan22/article/details/69788152</link><guid>https://blog.youkuaiyun.com/guokeyan22/article/details/69788152</guid><author>guokeyan22</author><pubDate>Sat, 08 Apr 2017 22:17:35 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[迪杰斯特拉算法]]></title><link>https://blog.youkuaiyun.com/guokeyan22/article/details/68065064</link><guid>https://blog.youkuaiyun.com/guokeyan22/article/details/68065064</guid><author>guokeyan22</author><pubDate>Wed, 29 Mar 2017 14:48:09 +0800</pubDate><description><![CDATA[。。。。。。]]></description><category></category></item><item><title><![CDATA[LRU与LFU]]></title><link>https://blog.youkuaiyun.com/guokeyan22/article/details/68064676</link><guid>https://blog.youkuaiyun.com/guokeyan22/article/details/68064676</guid><author>guokeyan22</author><pubDate>Wed, 29 Mar 2017 14:26:37 +0800</pubDate><description><![CDATA[LRU是最近最少使用页面置换算法(Least Recently Used),也就是首先淘汰最长时间未被使用的页面!

LFU是最近最不常用页面置换算法(Least Frequently Used),也就是淘汰一定时期内被访问次数最少的页!]]></description><category></category></item><item><title><![CDATA[IP地址的正则表达式]]></title><link>https://blog.youkuaiyun.com/guokeyan22/article/details/64437947</link><guid>https://blog.youkuaiyun.com/guokeyan22/article/details/64437947</guid><author>guokeyan22</author><pubDate>Tue, 21 Mar 2017 09:37:11 +0800</pubDate><description><![CDATA[正则表达式：

((2[0-4]\d|25[0-5]|[01]?\d\d?)\.){3}(2[0-4]\d|25[0-5]|[01]?\d\d?)

((2[0-4]\d|25[0-5]|[01]?\d\d?)\.){3}(2[0-4]\d|25[0-5]|[01]?\d\d?)

红色块代表：第一个字符是2，第二个字符是0到4，第三个字符是任意一位数字。表示200~249。

绿]]></description><category></category></item><item><title><![CDATA[台湾清华大学彭明辉教授的研究生手册]]></title><link>https://blog.youkuaiyun.com/guokeyan22/article/details/64437885</link><guid>https://blog.youkuaiyun.com/guokeyan22/article/details/64437885</guid><author>guokeyan22</author><pubDate>Tue, 21 Mar 2017 09:30:26 +0800</pubDate><description><![CDATA[一、论文的要求 
　　我对硕士论文的基本要求是： 
　　（1）论文的主要内容，是叙述一套方法在一个特定场合中的应用。 
　　（2）这套方法必须要有所创新或突破，并因而对学术界有所贡献。因此，它或者是解决既有问题的新方法，或者是既有方法的新应用，或者是以一个新的方法开启一整片新的应用领域。 
　　（3）在论文中，你必须要有能力提出足够的证据来让读者信服说：针对这个应用场合，你所提出来的方法确]]></description><category></category></item><item><title><![CDATA[如何通俗易懂地解释遗传算法]]></title><link>https://blog.youkuaiyun.com/guokeyan22/article/details/60965450</link><guid>https://blog.youkuaiyun.com/guokeyan22/article/details/60965450</guid><author>guokeyan22</author><pubDate>Thu, 09 Mar 2017 19:06:27 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[快速排序的Java语言与C语言实现]]></title><link>https://blog.youkuaiyun.com/guokeyan22/article/details/50845428</link><guid>https://blog.youkuaiyun.com/guokeyan22/article/details/50845428</guid><author>guokeyan22</author><pubDate>Thu, 10 Mar 2016 13:21:19 +0800</pubDate><description><![CDATA[C语言版本：
void sort(int *a, int left, int right)
{
    if(left >= right)/*如果左边索引大于或者等于右边的索引就代表已经整理完成一个组了*/
    {
        return ;
    }
    int i = left;
    int j = right;
    int key = a[left];
     
]]></description><category></category></item><item><title><![CDATA[递归解决全排列生成算法]]></title><link>https://blog.youkuaiyun.com/guokeyan22/article/details/50836480</link><guid>https://blog.youkuaiyun.com/guokeyan22/article/details/50836480</guid><author>guokeyan22</author><pubDate>Wed, 09 Mar 2016 16:44:44 +0800</pubDate><description><![CDATA[原文地址：http://blog.youkuaiyun.com/xiazdong/article/details/7986015



排列：从n个元素中任取m个元素，并按照一定的顺序进行排列，称为排列；
全排列：当n==m时，称为全排列。比如：集合{ 1,2,3}的全排列为：

{ 1 2 3 } { 1 3 2 } { 2 1 3 } { 2 3 1 } { 3 2 1 } { 3 1 2 ]]></description><category></category></item><item><title><![CDATA[（C++）二叉树中的那些常见的面试题]]></title><link>https://blog.youkuaiyun.com/guokeyan22/article/details/50758922</link><guid>https://blog.youkuaiyun.com/guokeyan22/article/details/50758922</guid><author>guokeyan22</author><pubDate>Sun, 28 Feb 2016 14:26:33 +0800</pubDate><description><![CDATA[文章来源： http://www.cnblogs.com/BeyondAnyTime/archive/2012/08/27/2659163.html一、关于二叉树二叉树作为树的一种，是一种重要的数据结构，也是面试官经常考的东西。昨天看了一下关于树中的面试题，发现二叉树中的面试题比较常见的题型大概有下面几个：创建一颗二叉树（先序，中序，后序）、遍历一颗二叉树（先序，中序，后序和层次遍历）、求二叉树中叶]]></description><category></category></item></channel></rss>