<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ydeway的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ydeway</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ydeway]]></copyright><item><title><![CDATA[一些好用的网址]]></title><link>https://blog.youkuaiyun.com/ydeway/article/details/93860558</link><guid>https://blog.youkuaiyun.com/ydeway/article/details/93860558</guid><author>ydeway</author><pubDate>Wed, 24 Jun 2020 13:07:46 +0800</pubDate><description><![CDATA[在线P图网站：https://www.uupoop.com

Node.js的NPM库：https://www.npmjs.com

PDF工具：https://smallpdf.com

JSON相关（不止JSON）：http://www.bejson.com

小书匠markdown：http://soft.xiaoshujiang.com

菜鸟教程：https://www.runoob.c...]]></description><category></category></item><item><title><![CDATA[知树的层次遍历序列及每个结点的度，将其实现为孩子兄弟表示法]]></title><link>https://blog.youkuaiyun.com/ydeway/article/details/106563670</link><guid>https://blog.youkuaiyun.com/ydeway/article/details/106563670</guid><author>ydeway</author><pubDate>Fri, 05 Jun 2020 09:30:05 +0800</pubDate><description><![CDATA[/**
* 知树的层次遍历序列及每个结点的度，将其实现为孩子兄弟表示法
* 当前结点度为孩子的个数，除了第一个孩子作为当前结点的左孩子，当前结点第n(n &gt; 0)个孩子的右孩子为当前结点第n + 1(n + 1 &lt; degree)个孩子
* 除根结点外，所有结点的右孩子在其父结点时已经处理完毕，当前结点只需要处理左孩子和孩子的右结点
*/

void cp(Node*[] node, int[] degree, int n) {
	//TODO: 先将每个结点的左右孩子指向为NULL
	int ]]></description><category></category></item><item><title><![CDATA[满二叉树知前序求后序]]></title><link>https://blog.youkuaiyun.com/ydeway/article/details/105863233</link><guid>https://blog.youkuaiyun.com/ydeway/article/details/105863233</guid><author>ydeway</author><pubDate>Thu, 30 Apr 2020 15:45:29 +0800</pubDate><description><![CDATA[/**
* 满二叉树的根结点把二叉树划分为两个结点数量相同的子树，以此类推
*/


Elem stack[MAX];
int top = -1;
void preToPost(Elem e[], int s, int t) {
	if(s &gt; t) return;
	stack[++top] = e[s];
	preToPost(e, (s + t)/2 + 1, t);
	preToPo...]]></description><category></category></item><item><title><![CDATA[层次遍历获取二叉树的宽度]]></title><link>https://blog.youkuaiyun.com/ydeway/article/details/105859465</link><guid>https://blog.youkuaiyun.com/ydeway/article/details/105859465</guid><author>ydeway</author><pubDate>Thu, 30 Apr 2020 13:14:17 +0800</pubDate><description><![CDATA[/**
* 2020-04-30
* 当第n层的最后一个结点被访问时，第n+1层的最后一个结点已经入队
*/
int getWidthOfBinTree(BTNode T) {
	if(!T) return;
	BTNode Q[MAX], last == T;
	int r, f, max, max_tmp;
	r = f = max= max_tmp = 0;
	Q[++r] = T;
	w...]]></description><category></category></item><item><title><![CDATA[二叉树的后序非递归及使用后序获取两个接点的第一个共同祖先]]></title><link>https://blog.youkuaiyun.com/ydeway/article/details/105858407</link><guid>https://blog.youkuaiyun.com/ydeway/article/details/105858407</guid><author>ydeway</author><pubDate>Thu, 30 Apr 2020 11:50:04 +0800</pubDate><description><![CDATA[//2020-04-30
//注意c的结构体赋值并非是传递结构体的引用（指针）
//js和Java写多了容易漏掉这个东西
#include&lt;stdio.h&gt;
#include&lt;stdlib.h&gt;
#define MAX 100
#define LEFT 0
#define RIGHT 1

typedef int Elem;

typedef struct BTNode {...]]></description><category></category></item><item><title><![CDATA[js函数同步问题]]></title><link>https://blog.youkuaiyun.com/ydeway/article/details/105242729</link><guid>https://blog.youkuaiyun.com/ydeway/article/details/105242729</guid><author>ydeway</author><pubDate>Wed, 01 Apr 2020 12:02:29 +0800</pubDate><description><![CDATA[let i = 1;

//模拟数据库操作，因此时间不确定
//使用setInterval时，两次f1执行时内部的异步回调无保证执行顺序
function f1() {
	setTimeout(() =&gt; {
		process.stdout.write(i + ' ');
		setTimeout(() =&gt; {
			i++;
		}, Number.parseInt(Math.r...]]></description><category></category></item><item><title><![CDATA[js比较两个数组中的元素是否相等]]></title><link>https://blog.youkuaiyun.com/ydeway/article/details/103457801</link><guid>https://blog.youkuaiyun.com/ydeway/article/details/103457801</guid><author>ydeway</author><pubDate>Mon, 09 Dec 2019 14:47:18 +0800</pubDate><description><![CDATA[arr1.sort().toString() === arr2.sort().toString();

]]></description><category></category></item><item><title><![CDATA[JS中的switch用法]]></title><link>https://blog.youkuaiyun.com/ydeway/article/details/103233181</link><guid>https://blog.youkuaiyun.com/ydeway/article/details/103233181</guid><author>ydeway</author><pubDate>Mon, 25 Nov 2019 10:31:25 +0800</pubDate><description><![CDATA[记录一下这种用法，可在case语句后做简单的判断操作
   switch(true) {
          case item.TOEICSCORE &lt; 250:
              countless250++;
            break;
          case item.TOEICSCORE &gt;= 250 &amp;&amp; item.TOEICSCO...]]></description><category></category></item><item><title><![CDATA[docker rpm 安装]]></title><link>https://blog.youkuaiyun.com/ydeway/article/details/102829340</link><guid>https://blog.youkuaiyun.com/ydeway/article/details/102829340</guid><author>ydeway</author><pubDate>Wed, 30 Oct 2019 23:23:51 +0800</pubDate><description><![CDATA[软件下载地址：https://download.docker.com
使用rpm安装时，需要的以来都在当前rpm目录下，不要瞎找

]]></description><category></category></item><item><title><![CDATA[linux笔记]]></title><link>https://blog.youkuaiyun.com/ydeway/article/details/102653343</link><guid>https://blog.youkuaiyun.com/ydeway/article/details/102653343</guid><author>ydeway</author><pubDate>Sun, 20 Oct 2019 20:39:28 +0800</pubDate><description><![CDATA[Cent OS
区分字母大小写，所有可识别的东西均已文件形式表示
命令行修改基本是临时生效，要永久修改需要修改配置文件
不以后缀名识别文件类型，文件类型是为了便于程序员识别
所有存储设备需要挂载才能使用
带空格的文件和目录在操作时用引号包含起来
129.28.78.146
基础知识
1.配置域名服务器（不一定能成功，可能需要自己配置ip）
（1）修改/etc/resolv.conf，在里面添加：n...]]></description><category></category></item><item><title><![CDATA[CentOS7.5源码包安装git编译时报错]]></title><link>https://blog.youkuaiyun.com/ydeway/article/details/102652905</link><guid>https://blog.youkuaiyun.com/ydeway/article/details/102652905</guid><author>ydeway</author><pubDate>Sun, 20 Oct 2019 20:38:59 +0800</pubDate><description><![CDATA[报错详细信息：
/usr/bin/perl Makefile.PL PREFIX='/usr/software/git' INSTALL_BASE='' --localedir='/usr/software/git/share/locale'
Can't locate ExtUtils/MakeMaker.pm in @INC (@INC contains: /usr/local/lib64/pe...]]></description><category></category></item><item><title><![CDATA[CommonJS及其module.exports和exports]]></title><link>https://blog.youkuaiyun.com/ydeway/article/details/102493678</link><guid>https://blog.youkuaiyun.com/ydeway/article/details/102493678</guid><author>ydeway</author><pubDate>Fri, 11 Oct 2019 01:05:16 +0800</pubDate><description><![CDATA[//fileName is fuckhim
exports.a = xx;
exports.b = yy;

//fileName is fuckyou
module.exports = yy;

const fuckhim= require('fuckhim');
const fuckyou= require('fuckyou');

每个模块文件为一个module对象，大概可以认为像下面这样
...]]></description><category></category></item><item><title><![CDATA[express-session]]></title><link>https://blog.youkuaiyun.com/ydeway/article/details/102493251</link><guid>https://blog.youkuaiyun.com/ydeway/article/details/102493251</guid><author>ydeway</author><pubDate>Fri, 11 Oct 2019 00:07:12 +0800</pubDate><description><![CDATA[前言

chrome控制台的cookie管理中，会比过期的实际时间少8个小时，但左上角中的cookie过期时间显示正常，而且cookie的过期时间也正常。

出现场景： 设置cookie的maxAge值，expire设置是否会出现这种情况，未知，但我觉得不会




...]]></description><category></category></item><item><title><![CDATA[文法]]></title><link>https://blog.youkuaiyun.com/ydeway/article/details/102385767</link><guid>https://blog.youkuaiyun.com/ydeway/article/details/102385767</guid><author>ydeway</author><pubDate>Tue, 08 Oct 2019 14:42:25 +0800</pubDate><description><![CDATA[文章目录文法基本概念文法的形式定义
文法
基本概念

符号：字母、数字、标点…
字母表∑：一个有穷符号集合*（比如ASCII码就是一个字母表）*

字母表的乘积

∑1∑2 = { ab | a∈∑1，b∈∑2}


字母表的n次幂

∑0 = ∅
Σn = Σn-1 * Σ，n &gt; 1


字母表Σ的正闭包

Σ+ = Σ ∪ Σ2 ∪ Σ3…
可以看做是len = 1、2、...n，的字...]]></description><category></category></item><item><title><![CDATA[请将磁盘插入"U盘"，无法对raw系统使用该命令]]></title><link>https://blog.youkuaiyun.com/ydeway/article/details/101323104</link><guid>https://blog.youkuaiyun.com/ydeway/article/details/101323104</guid><author>ydeway</author><pubDate>Wed, 25 Sep 2019 00:46:05 +0800</pubDate><description><![CDATA[MotherFucker
问题出现的场景：
  垃圾windows10官网的MediaCreationTool制作U盘启动盘时
  花了老子无数时间，还重买了个U盘，结果出现同样的问题，老子百度烂了都没找这是什么原因，最后偶然知道[raw文件系统](

...]]></description><category></category></item><item><title><![CDATA[git入门]]></title><link>https://blog.youkuaiyun.com/ydeway/article/details/101286622</link><guid>https://blog.youkuaiyun.com/ydeway/article/details/101286622</guid><author>ydeway</author><pubDate>Tue, 24 Sep 2019 15:14:04 +0800</pubDate><description><![CDATA[文章目录git的基本概念初始化仓库设置签名形式辨析签名级别跟踪文件查看历史版本前进或后退版本恢复被完全 删除的文件查看本地库与工作区的差异其他命令tips分支查看分支创建分支切换分支合并分支冲突解决远程仓库推送到远程仓库步骤提交本地代码从已存在的仓库中clone项目到本地从远端拉取变更tips跨团队协作`fork`操作SSH免密登录步骤本地操作远程仓库操作git文件管理机制分支领先 [^1]参考：...]]></description><category></category></item><item><title><![CDATA[十字链表的实现]]></title><link>https://blog.youkuaiyun.com/ydeway/article/details/101039672</link><guid>https://blog.youkuaiyun.com/ydeway/article/details/101039672</guid><author>ydeway</author><pubDate>Fri, 20 Sep 2019 10:49:36 +0800</pubDate><description><![CDATA[/*
*2018.9.12 17:09
*十字链表的实现
*注意rhead和chead都是顺序存储的
*其中的down和right并不指向某个结点
*/
#include&lt;stdio.h&gt;
#include&lt;stdlib.h&gt;

#define COLUMN 5

typedef struct Node{
	int r, c;
	int e;
	struct Node *d...]]></description><category></category></item><item><title><![CDATA[二叉树的非递归形式的前、中、后遍历以及层次遍历]]></title><link>https://blog.youkuaiyun.com/ydeway/article/details/101039691</link><guid>https://blog.youkuaiyun.com/ydeway/article/details/101039691</guid><author>ydeway</author><pubDate>Fri, 20 Sep 2019 10:49:27 +0800</pubDate><description><![CDATA[/**
*2018.09.14  17:37
*二叉树的遍历 not recursion
*先根，中根，后根，层次
*/
#include&lt;stdio.h&gt;
#define MAX 100
typedef struct BTNode {
	int e;
	struct BTNode *rchild, *lchild;
}BTNode;


void preOrder(BTNode *p...]]></description><category></category></item><item><title><![CDATA[二叉树中求值为k的结点的层数]]></title><link>https://blog.youkuaiyun.com/ydeway/article/details/101039700</link><guid>https://blog.youkuaiyun.com/ydeway/article/details/101039700</guid><author>ydeway</author><pubDate>Fri, 20 Sep 2019 10:49:17 +0800</pubDate><description><![CDATA[/**
*2018.10.24 14:47
*二叉树中求值为k的结点的层数
*/
#include&lt;stdio.h&gt;

#define MAX 100

typedef char Elem;

typedef struct BTNode{
	Elem e;
	struct BTNode* lchild;
	struct BTNode* rchild;
}BTNode;


int ge...]]></description><category></category></item><item><title><![CDATA[赫夫曼编码]]></title><link>https://blog.youkuaiyun.com/ydeway/article/details/101039710</link><guid>https://blog.youkuaiyun.com/ydeway/article/details/101039710</guid><author>ydeway</author><pubDate>Fri, 20 Sep 2019 10:49:06 +0800</pubDate><description><![CDATA[/**
*2018.09.17  16:09
*赫夫曼编码
*/

#include&lt;stdio.h&gt;
#include&lt;stdlib.h&gt;
#include&lt;string.h&gt;
#include&lt;stdbool.h&gt;


typedef struct HuffmanTree {
	int weight;
	int parent, lchild, r...]]></description><category></category></item></channel></rss>