<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[T_muller的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/T_muller</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; T_muller]]></copyright><item><title><![CDATA[GMP大数库实现RSA算法]]></title><link>https://blog.youkuaiyun.com/T_muller/article/details/108426978</link><guid>https://blog.youkuaiyun.com/T_muller/article/details/108426978</guid><author>T_muller</author><pubDate>Sun, 06 Sep 2020 00:42:29 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;stdio.h&gt;
#include "gmp.h"
#define MILLER_RABIN_TEST_NUM 5
#define PRIME_BIT 512
typedef unsigned char Bit8;
typedef unsigned short Bit16;
typedef unsigned int Bit32;
void getRSAparam(mpz_t n, mpz_t p, mpz_t q, mpz_]]></description><category></category></item><item><title><![CDATA[LeetCode 重建二叉树（根据中序遍历和先序遍历重建二叉树）]]></title><link>https://blog.youkuaiyun.com/T_muller/article/details/107760344</link><guid>https://blog.youkuaiyun.com/T_muller/article/details/107760344</guid><author>T_muller</author><pubDate>Mon, 03 Aug 2020 11:38:44 +0800</pubDate><description><![CDATA[题目要求：输入某二叉树的前序遍历和中序遍历的结果，请重建该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。
例如，给出：
前序遍历 preorder = [3,9,20,15,7]
中序遍历 inorder = [9,3,15,20,7]
返回如下的二叉树：
    3
   / \
  9  20
    /  \
   15   7

限制：0 &lt;= 节点个数 &lt;= 5000
来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems]]></description><category></category></item></channel></rss>