<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[struver的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/struver</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; struver]]></copyright><item><title><![CDATA[2021-03-09]]></title><link>https://blog.youkuaiyun.com/struver/article/details/114581094</link><guid>https://blog.youkuaiyun.com/struver/article/details/114581094</guid><author>struver</author><pubDate>Tue, 09 Mar 2021 13:50:26 +0800</pubDate><description><![CDATA[PAT甲级2019春季题目AC代码下面展示一些 内联代码片。

#include&lt;bits/stdc++.h&gt;
using namespace std;

bool isPrime(int a)
{
    if(a&lt;2)
        return false;

    for(int i=2;i&lt;=sqrt(1.0*a);i++)
    {
        if(a%i==0)
            return false;
    }

    return true]]></description><category></category></item><item><title><![CDATA[OS实验课之添加linux系统调用并编译内核]]></title><link>https://blog.youkuaiyun.com/struver/article/details/105321675</link><guid>https://blog.youkuaiyun.com/struver/article/details/105321675</guid><author>struver</author><pubDate>Sun, 05 Apr 2020 03:18:30 +0800</pubDate><description><![CDATA[OS实验课之添加linux系统调用并编译内核
最近OS实验课要给linux系统添加一个系统调用，并且重新编译内核
按理来说其实整个过程一共就清晰的几步:
修改系统调用表-&gt;声明系统调用-&gt;实现系统调用
-&gt;make menuconfig -&gt; make -&gt; make modules
-&gt;make modules_install -&gt; make insta...]]></description><category></category></item><item><title><![CDATA[斐波那契堆]]></title><link>https://blog.youkuaiyun.com/struver/article/details/102644499</link><guid>https://blog.youkuaiyun.com/struver/article/details/102644499</guid><author>struver</author><pubDate>Sat, 19 Oct 2019 23:16:16 +0800</pubDate><description><![CDATA[/****************************
说明：
代码中Fibonacci Heap 用变量heap表示
结点通常用x，y等表示
****************************/

#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;stdlib.h&gt;
#include&lt;string.h&g...]]></description><category></category></item><item><title><![CDATA[KMP算法求最长回文串]]></title><link>https://blog.youkuaiyun.com/struver/article/details/102644475</link><guid>https://blog.youkuaiyun.com/struver/article/details/102644475</guid><author>struver</author><pubDate>Sat, 19 Oct 2019 23:12:50 +0800</pubDate><description><![CDATA[#include&lt;stdio.h&gt;
#include&lt;string.h&gt;

void getNext(char s[],int len,int next[])
{
    next[0]=-1;
    int j=next[0];

    for(int i=1; i&lt;len; i++)
    {

        while(j!=-1&amp;&amp;s[...]]></description><category></category></item><item><title><![CDATA[迷宫求解]]></title><link>https://blog.youkuaiyun.com/struver/article/details/102637481</link><guid>https://blog.youkuaiyun.com/struver/article/details/102637481</guid><author>struver</author><pubDate>Sat, 19 Oct 2019 13:15:18 +0800</pubDate><description><![CDATA[在这里插入代码片

#include
#include
using namespace std;
const int maxn=100;            //迷宫最大长度
bool inq[maxn][maxn]={false};  //访问标志数组
char mx[maxn][maxn];           //存放迷宫
int n,m;
struct node{            ...]]></description><category></category></item><item><title><![CDATA[二项堆]]></title><link>https://blog.youkuaiyun.com/struver/article/details/102637434</link><guid>https://blog.youkuaiyun.com/struver/article/details/102637434</guid><author>struver</author><pubDate>Sat, 19 Oct 2019 13:09:55 +0800</pubDate><description><![CDATA[/*******************************************************
  基本思想：应用二项堆的性质：
            1.H中每个二项树遵循最小堆性质（结点的关键字最小）
            2.任意non-negative k，H中至多有以可二项树的根的度数为k（度数唯一）

  建堆时，对于单个节点，malloc结点度都是0，直接按照前...]]></description><category></category></item><item><title><![CDATA[算法导论之Red-Black-Tree(C语言实现)&&平衡二叉树(C++实现)]]></title><link>https://blog.youkuaiyun.com/struver/article/details/102636755</link><guid>https://blog.youkuaiyun.com/struver/article/details/102636755</guid><author>struver</author><pubDate>Sat, 19 Oct 2019 11:46:16 +0800</pubDate><description><![CDATA[**算法导论之红黑树（C语言实现）**
                         **与平衡二叉树（C++实现）**

红黑树：
/**********************************************
红黑树有如下五个性质：
1-3：每个结点或红或黑、根节点黑、叶结点（NULL）黑
4：  若结点是红的，则孩子是黑的...]]></description><category></category></item></channel></rss>