<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[fairydeng的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/fairydeng</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; fairydeng]]></copyright><item><title><![CDATA[微信支付出现的错误提示及解决方法]]></title><link>https://blog.youkuaiyun.com/fairydeng/article/details/93315844</link><guid>https://blog.youkuaiyun.com/fairydeng/article/details/93315844</guid><author>fairydeng</author><pubDate>Sat, 22 Jun 2019 12:38:22 +0800</pubDate><description><![CDATA[小程序支付踩过的坑：
1、 统一下单：提示签名错误
可能原因：key错误，请确认key（商户交易秘钥）
2、空对象异常 &amp; total_fee错误
可能原因：没加"prepay_id="；（后台和小程序端都要加"prepay_id="）


3、 支付签名错误（二次签名）
可能原因：
（1）appId写成了appid

统一下单是appid；

小程序调起支付是appId；
一定要注意两者...]]></description><category></category></item><item><title><![CDATA[07-图5 Saving James Bond - Hard Version（Java实现）]]></title><link>https://blog.youkuaiyun.com/fairydeng/article/details/89923263</link><guid>https://blog.youkuaiyun.com/fairydeng/article/details/89923263</guid><author>fairydeng</author><pubDate>Tue, 07 May 2019 16:09:32 +0800</pubDate><description><![CDATA[This time let us consider the situation in the movie “Live and Let Die” in which James Bond, the world’s most famous spy, was captured by a group of drug dealers. He was sent to a small piece of land ...]]></description><category></category></item><item><title><![CDATA[07-图4 哈利·波特的考试（Java实现）]]></title><link>https://blog.youkuaiyun.com/fairydeng/article/details/89916957</link><guid>https://blog.youkuaiyun.com/fairydeng/article/details/89916957</guid><author>fairydeng</author><pubDate>Tue, 07 May 2019 11:04:30 +0800</pubDate><description><![CDATA[哈利·波特要考试了，他需要你的帮助。这门课学的是用魔咒将一种动物变成另一种动物的本事。例如将猫变成老鼠的魔咒是haha，将老鼠变成鱼的魔咒是hehe等等。反方向变化的魔咒就是简单地将原来的魔咒倒过来念，例如ahah可以将老鼠变成猫。另外，如果想把猫变成鱼，可以通过念一个直接魔咒lalala，也可以将猫变老鼠、老鼠变鱼的魔咒连起来念：hahahehe。
现在哈利·波特的手里有一本教材，里面列出了所有...]]></description><category></category></item><item><title><![CDATA[Forwards on Weibo （Java实现)]]></title><link>https://blog.youkuaiyun.com/fairydeng/article/details/89473443</link><guid>https://blog.youkuaiyun.com/fairydeng/article/details/89473443</guid><author>fairydeng</author><pubDate>Tue, 23 Apr 2019 15:20:06 +0800</pubDate><description><![CDATA[Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, and may follow many other users as well. Hence a social network is formed with followers relations. When a ...]]></description><category></category></item><item><title><![CDATA[图3 六度空间（Java实现）]]></title><link>https://blog.youkuaiyun.com/fairydeng/article/details/89470635</link><guid>https://blog.youkuaiyun.com/fairydeng/article/details/89470635</guid><author>fairydeng</author><pubDate>Tue, 23 Apr 2019 13:31:39 +0800</pubDate><description><![CDATA[六度空间”理论又称作“六度分隔（Six Degrees of Separation）”理论。这个理论可以通俗地阐述为：“你和任何一个陌生人之间所间隔的人不会超过六个，也就是说，最多通过五个人你就能够认识任何一个陌生人。”如图1所示。
“六度空间”理论虽然得到广泛的认同，并且正在得到越来越多的应用。但是数十年来，试图验证这个理论始终是许多社会学家努力追求的目标。然而由于历史的原因，这样的研究具有太大...]]></description><category></category></item><item><title><![CDATA[Saving James Bond - Easy Version（Java实现）]]></title><link>https://blog.youkuaiyun.com/fairydeng/article/details/89467929</link><guid>https://blog.youkuaiyun.com/fairydeng/article/details/89467929</guid><author>fairydeng</author><pubDate>Tue, 23 Apr 2019 10:49:33 +0800</pubDate><description><![CDATA[This time let us consider the situation in the movie “Live and Let Die” in which James Bond, the world’s most famous spy, was captured by a group of drug dealers. He was sent to a small piece of land ...]]></description><category></category></item><item><title><![CDATA[列出连通集 - Java]]></title><link>https://blog.youkuaiyun.com/fairydeng/article/details/89420211</link><guid>https://blog.youkuaiyun.com/fairydeng/article/details/89420211</guid><author>fairydeng</author><pubDate>Sat, 20 Apr 2019 17:08:16 +0800</pubDate><description><![CDATA[给定一个有N个顶点和E条边的无向图，请用DFS和BFS分别列出其所有的连通集。假设顶点从0到N−1编号。进行搜索时，假设我们总是从编号最小的顶点出发，按编号递增的顺序访问邻接点。
输入格式:
输入第1行给出2个整数N(0&lt;N≤10)和E，分别是图的顶点数和边数。随后E行，每行给出一条边的两个端点。每行中的数字之间用1空格分隔。
输出格式:
按照"{ v​1 v​2 … v​k }"的格式，每...]]></description><category></category></item><item><title><![CDATA[树7 堆中的路径 - Java实现]]></title><link>https://blog.youkuaiyun.com/fairydeng/article/details/89025983</link><guid>https://blog.youkuaiyun.com/fairydeng/article/details/89025983</guid><author>fairydeng</author><pubDate>Thu, 04 Apr 2019 16:04:16 +0800</pubDate><description><![CDATA[将一系列给定数字插入一个初始为空的小顶堆H[]。随后对任意给定的下标i，打印从H[i]到根结点的路径。
输入格式:
每组测试第1行包含2个正整数N和M(≤1000)，分别是插入元素的个数、以及需要打印的路径条数。下一行给出区间[-10000, 10000]内的N个要被插入一个初始为空的小顶堆的整数。最后一行给出M个下标。
输出格式:
对输入中给出的每个下标i，在一行中输出从H[i]到根结点的路径上...]]></description><category></category></item><item><title><![CDATA[Complete Binary Search Tree - Java实现]]></title><link>https://blog.youkuaiyun.com/fairydeng/article/details/88915013</link><guid>https://blog.youkuaiyun.com/fairydeng/article/details/88915013</guid><author>fairydeng</author><pubDate>Sat, 30 Mar 2019 16:51:15 +0800</pubDate><description><![CDATA[A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:
The left subtree of a node contains only nodes with keys less than the node’s key.
The right subt...]]></description><category></category></item><item><title><![CDATA[Root of AVL Tree - Java实现]]></title><link>https://blog.youkuaiyun.com/fairydeng/article/details/88892216</link><guid>https://blog.youkuaiyun.com/fairydeng/article/details/88892216</guid><author>fairydeng</author><pubDate>Fri, 29 Mar 2019 14:41:26 +0800</pubDate><description><![CDATA[An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is...]]></description><category></category></item><item><title><![CDATA[是否同一棵二叉搜索树 - Java实现]]></title><link>https://blog.youkuaiyun.com/fairydeng/article/details/88892006</link><guid>https://blog.youkuaiyun.com/fairydeng/article/details/88892006</guid><author>fairydeng</author><pubDate>Fri, 29 Mar 2019 14:35:03 +0800</pubDate><description><![CDATA[给定一个插入序列就可以唯一确定一棵二叉搜索树。然而，一棵给定的二叉搜索树却可以由多种不同的插入序列得到。例如分别按照序列{2, 1, 3}和{2, 3, 1}插入初始为空的二叉搜索树，都得到一样的结果。于是对于输入的各种插入序列，你需要判断它们是否能生成一样的二叉搜索树。
输入格式:
输入包含若干组测试数据。每组数据的第1行给出两个正整数N (≤10)和L，分别是每个序列插入元素的个数和需要检查的...]]></description><category></category></item><item><title><![CDATA[Tree Traversals Again - Java实现]]></title><link>https://blog.youkuaiyun.com/fairydeng/article/details/88824739</link><guid>https://blog.youkuaiyun.com/fairydeng/article/details/88824739</guid><author>fairydeng</author><pubDate>Tue, 26 Mar 2019 17:04:33 +0800</pubDate><description><![CDATA[An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the keys numbered from 1 to 6) is traversed, the stac...]]></description><category></category></item><item><title><![CDATA[List Leaves --  Java实现]]></title><link>https://blog.youkuaiyun.com/fairydeng/article/details/88745595</link><guid>https://blog.youkuaiyun.com/fairydeng/article/details/88745595</guid><author>fairydeng</author><pubDate>Fri, 22 Mar 2019 17:03:40 +0800</pubDate><description><![CDATA[Given a tree, you are supposed to list all the leaves in the order of top down, and left to right.
Input Specification:
Each input file contains one test case. For each case, the first line gives a po...]]></description><category></category></item><item><title><![CDATA[03-树1 树的同构  --  Java实现]]></title><link>https://blog.youkuaiyun.com/fairydeng/article/details/88745442</link><guid>https://blog.youkuaiyun.com/fairydeng/article/details/88745442</guid><author>fairydeng</author><pubDate>Fri, 22 Mar 2019 16:59:35 +0800</pubDate><description><![CDATA[给定两棵树T1和T2。如果T1可以通过若干次左右孩子互换就变成T2，则我们称两棵树是“同构”的。例如图1给出的两棵树就是同构的，因为我们把其中一棵树的结点A、B、G的左右孩子互换后，就得到另外一棵树。而图2就不是同构的。

现给定两棵树，请你判断它们是否是同构的。
输入格式:
输入给出2棵二叉树树的信息。对于每棵树，首先在一行中给出一个非负整数N (≤10)，即该树的结点数（此时假设结点从0到N−...]]></description><category></category></item><item><title><![CDATA[Pop Sequence - Java参考代码]]></title><link>https://blog.youkuaiyun.com/fairydeng/article/details/88634713</link><guid>https://blog.youkuaiyun.com/fairydeng/article/details/88634713</guid><author>fairydeng</author><pubDate>Mon, 18 Mar 2019 10:54:14 +0800</pubDate><description><![CDATA[Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, …, N and pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop sequence of the...]]></description><category></category></item><item><title><![CDATA[01-复杂度2. Maximum Subsequence Sum (25)  ---  Java]]></title><link>https://blog.youkuaiyun.com/fairydeng/article/details/88391118</link><guid>https://blog.youkuaiyun.com/fairydeng/article/details/88391118</guid><author>fairydeng</author><pubDate>Mon, 11 Mar 2019 11:53:03 +0800</pubDate><description><![CDATA[Given a sequence of K integers { N1, N2, …, NK }. A continuous subsequence is defined to be { Ni, Ni+1, …, Nj } where 1 &amp;amp;lt;= i &amp;amp;lt;= j &amp;amp;lt;= K. The Maximum Subsequence is the continuous subsequence w...]]></description><category></category></item><item><title><![CDATA[对px、em和rem自己的小理解]]></title><link>https://blog.youkuaiyun.com/fairydeng/article/details/85261666</link><guid>https://blog.youkuaiyun.com/fairydeng/article/details/85261666</guid><author>fairydeng</author><pubDate>Wed, 26 Dec 2018 14:33:38 +0800</pubDate><description><![CDATA[px：像素；
em：相对于父元素的尺寸；
rem：相对于根元素的尺寸；（css3新增的，可以适应不同的设备分辨率）
html中若设置font-size=62.5%，则rem与px的比例为10:1（这么设置比较好计算）；未设置，则是浏览器默认的16:1（即默认font-size=16px）。

...]]></description><category></category></item><item><title><![CDATA[学习反射时候遇到的那些事儿]]></title><link>https://blog.youkuaiyun.com/fairydeng/article/details/85258032</link><guid>https://blog.youkuaiyun.com/fairydeng/article/details/85258032</guid><author>fairydeng</author><pubDate>Wed, 26 Dec 2018 10:29:36 +0800</pubDate><description><![CDATA[用到反射时，出现报错：java.lang.IllegalArgumentException以及java.lang.NoClassDefFoundError的原因]]></description><category></category></item><item><title><![CDATA[H5新闻垂直滚动效果]]></title><link>https://blog.youkuaiyun.com/fairydeng/article/details/83274262</link><guid>https://blog.youkuaiyun.com/fairydeng/article/details/83274262</guid><author>fairydeng</author><pubDate>Mon, 22 Oct 2018 16:05:34 +0800</pubDate><description><![CDATA[做成不同样式的垂直滚动：无缝垂直滚动，间歇性垂直滚动（一次滚动一条），间歇性垂直滚动（一次滚动两条）；
*先上代码（想知道原理的请往后看）~~~~*
变量解释：
speed：滚动的速度；
delay：暂停的时长；
scrollTop ：滚动的高度；
scrollHeight：滚动元素的高度；
1. 无缝垂直滚动（无停歇的一直滚动）
&amp;amp;lt;!doctype html&amp;amp;gt;
&amp;amp;lt;html&amp;amp;gt...]]></description><category></category></item></channel></rss>