<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[瞭望的叶子的专栏]]></title><description><![CDATA[让我们谈谈人生吧]]></description><link>https://blog.youkuaiyun.com/a954680384</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; a954680384]]></copyright><item><title><![CDATA[关于 Error response from daemon: dial unix docker.raw.sock: connect:not such file or directory]]></title><link>https://blog.youkuaiyun.com/a954680384/article/details/108529706</link><guid>https://blog.youkuaiyun.com/a954680384/article/details/108529706</guid><author>a954680384</author><pubDate>Fri, 11 Sep 2020 10:47:30 +0800</pubDate><description><![CDATA[reset to factory defaults就好了

]]></description><category></category></item><item><title><![CDATA[enableDefaultTyping is deprecated这个方法已经被弃用]]></title><link>https://blog.youkuaiyun.com/a954680384/article/details/104727994</link><guid>https://blog.youkuaiyun.com/a954680384/article/details/104727994</guid><author>a954680384</author><pubDate>Sun, 08 Mar 2020 10:17:59 +0800</pubDate><description><![CDATA[起因是使用 objectMapper.enableDefaultTyping()方法是发现被弃用。

建议使用 objectMapper.activateDefaultTyping()方法替代它。
]]></description><category></category></item><item><title><![CDATA[关于keras中得RMSprob参数说明]]></title><link>https://blog.youkuaiyun.com/a954680384/article/details/88080543</link><guid>https://blog.youkuaiyun.com/a954680384/article/details/88080543</guid><author>a954680384</author><pubDate>Sat, 02 Mar 2019 20:06:48 +0800</pubDate><description><![CDATA[其中lr为学习率，rho为吴恩达视频中得β，epsilon即公式中防止出现0，decay官方文档说明为每次更新学习率下降多少
]]></description><category></category></item><item><title><![CDATA[碰到ConvergenceWarning的情况]]></title><link>https://blog.youkuaiyun.com/a954680384/article/details/88032760</link><guid>https://blog.youkuaiyun.com/a954680384/article/details/88032760</guid><author>a954680384</author><pubDate>Thu, 28 Feb 2019 16:12:11 +0800</pubDate><description><![CDATA[出现ConvergenceWarning: Liblinear failed to converge, increase the number of iterations.  &quot;the number of iterations.&quot;, ConvergenceWarning)

可尝试将max_iter增加，默认是1000

]]></description><category></category></item><item><title><![CDATA[针对FutureWarning的情况]]></title><link>https://blog.youkuaiyun.com/a954680384/article/details/88032225</link><guid>https://blog.youkuaiyun.com/a954680384/article/details/88032225</guid><author>a954680384</author><pubDate>Thu, 28 Feb 2019 16:03:14 +0800</pubDate><description><![CDATA[当出现 FutureWarning: Default multi_class will be changed to 'auto' in 0.22. Specify the multi_class option to silence this warning.
 &quot;this warning.&quot;, FutureWarning)懒得打字直接上图

]]></description><category></category></item><item><title><![CDATA[PATl两个有序链表序列的合并]]></title><link>https://blog.youkuaiyun.com/a954680384/article/details/69258363</link><guid>https://blog.youkuaiyun.com/a954680384/article/details/69258363</guid><author>a954680384</author><pubDate>Wed, 05 Apr 2017 15:49:59 +0800</pubDate><description><![CDATA[02-线性结构1 两个有序链表序列的合并   (15分)


本题要求实现一个函数，将两个链表表示的递增整数序列合并为一个非递减的整数序列。
函数接口定义：
List Merge( List L1, List L2 );

其中List结构定义如下：
typedef struct Node *PtrToNode;
struct Node {
    ElementType Data;]]></description><category></category></item><item><title><![CDATA[PAT 是否为同一棵二叉搜索树]]></title><link>https://blog.youkuaiyun.com/a954680384/article/details/52071988</link><guid>https://blog.youkuaiyun.com/a954680384/article/details/52071988</guid><author>a954680384</author><pubDate>Sat, 30 Jul 2016 11:52:45 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
using namespace std;
int n,l;
typedef struct dataStruct{
    dataStruct* left;
    dataStruct* right;
    int         data;


}*node;
vo]]></description><category></category></item><item><title><![CDATA[PAT 表达式转换]]></title><link>https://blog.youkuaiyun.com/a954680384/article/details/51892883</link><guid>https://blog.youkuaiyun.com/a954680384/article/details/51892883</guid><author>a954680384</author><pubDate>Tue, 12 Jul 2016 21:53:02 +0800</pubDate><description><![CDATA[思路其实都是一样，主要主要细节
如-2*(+3)这样的需要考虑正负号
如1.236*4.5需要考虑小数点
如123这样的考虑数需要连贯


下面附上代码和测试数据
-2*(+2) .--------            -2 2 *
1.236*2.368--------------- 1.236 2.368  *

((4+5)*9-(8+2))/5 -----------]]></description><category></category></item><item><title><![CDATA[PAT判断搜索树]]></title><link>https://blog.youkuaiyun.com/a954680384/article/details/51885886</link><guid>https://blog.youkuaiyun.com/a954680384/article/details/51885886</guid><author>a954680384</author><pubDate>Tue, 12 Jul 2016 08:59:40 +0800</pubDate><description><![CDATA[解题思路，题目给出一行数字判断是否为二叉搜索树或者二叉镜像树

那么我们可以根据这行数字创建二叉一个二叉搜索树和一个二叉镜像

树。然后求出它们的前序，判断是二叉搜索树还是二叉镜像树，因为

前序序列一定和给出的数字一样所以很好判断。判断之后，求出后序

的表达式，然后输出之就OK了




#include 
#include 
#include 
#define MA]]></description><category></category></item><item><title><![CDATA[PAT堆栈模拟队列]]></title><link>https://blog.youkuaiyun.com/a954680384/article/details/51885878</link><guid>https://blog.youkuaiyun.com/a954680384/article/details/51885878</guid><author>a954680384</author><pubDate>Tue, 12 Jul 2016 08:58:04 +0800</pubDate><description><![CDATA[使用堆栈模拟队列，相当于当用两个桶装水：

一：为A 装水的时候

当左边的水桶满了，而右边的不为空的话，就可以说不能倒水了，输出Full

当左边的水桶没满，就可以倒到它满为止

当左边的水桶满了，右边的没有水，就把所有的水倒到右边去




二：倒水的时候

当右边的水桶满了之后就可以倒

如果是空的重新从左边装水

如果左边也没有水，

那么说明是空]]></description><category></category></item><item><title><![CDATA[PAT寻找大富翁]]></title><link>https://blog.youkuaiyun.com/a954680384/article/details/51885870</link><guid>https://blog.youkuaiyun.com/a954680384/article/details/51885870</guid><author>a954680384</author><pubDate>Tue, 12 Jul 2016 08:56:30 +0800</pubDate><description><![CDATA[利用计数查找来寻找数据


#include 
#include 
#include 
using namespace std;
int a[1000005];
int main(){
    int n,m;
    scanf("%d %d",&n,&m);
    memset(a,0,sizeof(a));
    if(m > n)m = n;
    int value;
   ]]></description><category></category></item><item><title><![CDATA[PAT银行业务简单模拟]]></title><link>https://blog.youkuaiyun.com/a954680384/article/details/51885848</link><guid>https://blog.youkuaiyun.com/a954680384/article/details/51885848</guid><author>a954680384</author><pubDate>Tue, 12 Jul 2016 08:53:29 +0800</pubDate><description><![CDATA[这个题主要需要考虑到两点




当A窗口没人时和当B窗口没人时就可以了

如测试案例2 1 3, 2 2 4
#include 
#include 
#include 
using namespace std;
queuea;//A窗口的队列
queueb;//B窗口的队列
int main(){
    int n,k;
    cin>>n;
    for(int i = ]]></description><category></category></item><item><title><![CDATA[网络信息安全攻防实验室 脚本关第七关]]></title><link>https://blog.youkuaiyun.com/a954680384/article/details/51456663</link><guid>https://blog.youkuaiyun.com/a954680384/article/details/51456663</guid><author>a954680384</author><pubDate>Thu, 19 May 2016 20:09:28 +0800</pubDate><description><![CDATA[http://lab1.xseclab.com/vcode3_9d1ea7ad52ad93c04a837e0808b17097/index.php
这一道题，构造一个Seesion对象即可，利用该对象进行提交就行了]]></description><category></category></item><item><title><![CDATA[网络信息安全攻防实验室 脚本关第六关]]></title><link>https://blog.youkuaiyun.com/a954680384/article/details/51456632</link><guid>https://blog.youkuaiyun.com/a954680384/article/details/51456632</guid><author>a954680384</author><pubDate>Thu, 19 May 2016 20:07:17 +0800</pubDate><description><![CDATA[http://lab1.xseclab.com/vcode2_a6e6bac0b47c8187b09deb20babc0e85/login.php
这一关与第五关类似，但是验证码验证一次就失效了，实际上和第五关是一回事]]></description><category></category></item><item><title><![CDATA[网络信息安全攻防实验室 脚本关第五关]]></title><link>https://blog.youkuaiyun.com/a954680384/article/details/51456476</link><guid>https://blog.youkuaiyun.com/a954680384/article/details/51456476</guid><author>a954680384</author><pubDate>Thu, 19 May 2016 19:45:21 +0800</pubDate><description><![CDATA[逗比的验证码，有没有难道不一样吗？ 这一关的验证码没有设置成post提交一次就失效，所以在获取得到了验证码以后，可以直接多次提交，用python脚本来实现，代码如下：]]></description><category></category></item><item><title><![CDATA[网络信息安全攻防实验室 第四关]]></title><link>https://blog.youkuaiyun.com/a954680384/article/details/51456430</link><guid>https://blog.youkuaiyun.com/a954680384/article/details/51456430</guid><author>a954680384</author><pubDate>Thu, 19 May 2016 19:40:28 +0800</pubDate><description><![CDATA[第5题:怎么就是不弹出key呢？

提交说明：提交前14个字符即可过关

这一关主要考的是js的驾驭能力，查看源代码发现变量a其实是一个匿名函数，而且js里面也禁用了一些常用的弹出对话框的函数，由于js是基于客户端浏览器的，所以我们把代码复制下来，美化后改成如下格式运行即可得到key



var a = function () {
  var b = function (p, a,]]></description><category></category></item><item><title><![CDATA[网络信息安全攻防实验室 第三关]]></title><link>https://blog.youkuaiyun.com/a954680384/article/details/51456418</link><guid>https://blog.youkuaiyun.com/a954680384/article/details/51456418</guid><author>a954680384</author><pubDate>Thu, 19 May 2016 19:38:00 +0800</pubDate><description><![CDATA[http://hackinglab.cn/ShowQues.php?type=scripts
考查空字符，那么就都试一下吧%00,%0a,%0d,%0a%0d,%0b,%0c,%a0,null都是表示为空的
最后答案为null]]></description><category></category></item><item><title><![CDATA[网络信息安全攻防实验室 脚本关第二关]]></title><link>https://blog.youkuaiyun.com/a954680384/article/details/51456225</link><guid>https://blog.youkuaiyun.com/a954680384/article/details/51456225</guid><author>a954680384</author><pubDate>Thu, 19 May 2016 19:09:06 +0800</pubDate><description><![CDATA[http://lab1.xseclab.com/xss2_0d557e6d2a4ac08b749b61473a075be1/index.php题目
这一关，响应时间太快
所以咱们可以写个脚本进行解释]]></description><category></category></item><item><title><![CDATA[网络信息安全攻防平台 脚本关第一关]]></title><link>https://blog.youkuaiyun.com/a954680384/article/details/51442981</link><guid>https://blog.youkuaiyun.com/a954680384/article/details/51442981</guid><author>a954680384</author><pubDate>Wed, 18 May 2016 12:36:53 +0800</pubDate><description><![CDATA[http://lab1.xseclab.com/xss1_30ac8668cd453e7e387c76b132b140bb/index.php
虽然上面写着是脚本关，但是我还是想看一下它的响应包，果然发现了他的答案]]></description><category></category></item><item><title><![CDATA[网络信息安全实验室 补充基础关]]></title><link>https://blog.youkuaiyun.com/a954680384/article/details/51438691</link><guid>https://blog.youkuaiyun.com/a954680384/article/details/51438691</guid><author>a954680384</author><pubDate>Wed, 18 May 2016 12:19:50 +0800</pubDate><description><![CDATA[第四关据说MD5加密很安全，真的是么？
分值: 200

e0960851294d7b2253978ba858e24633




对其进行MD5解密即可




第五关

http://lab1.xseclab.com/base1_0ef337f3afbe42d5619d7a36c19c20ab/index.php


咱们打开火狐浏览器，按F12打开，查看请]]></description><category></category></item></channel></rss>