<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[lxxxxxl的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_36045946</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_36045946]]></copyright><item><title><![CDATA[samba搭建实现windows与linux文件共享]]></title><link>https://blog.youkuaiyun.com/qq_36045946/article/details/85225885</link><guid>https://blog.youkuaiyun.com/qq_36045946/article/details/85225885</guid><author>qq_36045946</author><pubDate>Sun, 23 Dec 2018 20:39:03 +0800</pubDate><description><![CDATA[Linux下：

安装samba服务


yum install samba
chkconfig smb on    # 设置smb服务开机启动
service smb start   # 启动smb服务
mkdir /srv/share    # 设置共享目录
chmod -R 777 /srv/share    # 设置权限
smbpasswd -a lxl    # 把账号加入smb服务中
...]]></description><category></category></item><item><title><![CDATA[PhpStrom安装Xdebug]]></title><link>https://blog.youkuaiyun.com/qq_36045946/article/details/84714376</link><guid>https://blog.youkuaiyun.com/qq_36045946/article/details/84714376</guid><author>qq_36045946</author><pubDate>Sun, 02 Dec 2018 15:34:44 +0800</pubDate><description><![CDATA[1.下载Xdebug

https://xdebug.org/wizard.php

进入上面网址将phpinfo输出的信息复制进去，点击分析即可下载最适合的Xdebug版本





2.安装Xdebug

将下载的扩展放进ext文件夹里，并在php.ini添加配置项，重启nginx，使用 php-m 查看是否已经加载Xdebug模块





3.PhpStrom设置









4.开...]]></description><category></category></item><item><title><![CDATA[读书笔记 —— 《深入浅出MySQL数据库开发、优化与管理维护 第2版》]]></title><link>https://blog.youkuaiyun.com/qq_36045946/article/details/82971909</link><guid>https://blog.youkuaiyun.com/qq_36045946/article/details/82971909</guid><author>qq_36045946</author><pubDate>Mon, 08 Oct 2018 18:32:19 +0800</pubDate><description><![CDATA[目录

第1章 Mysql的安装与配置

1.1 启动和关闭Mysql服务

第2章 SQL基础

2.1 SQL分类

2.2 常用语句

第3章 Mysql支持的数据类型

3.1 数值类型

3.2 日期时间类型

3.3 字符串类型

第4章 Mysql中的运算符

4.1 运算符优先级

第7章 表类型(存储引擎)的选择

7.1 各种存储引擎的特性

7.2 MyISAM

7.3 I...]]></description><category></category></item><item><title><![CDATA[TCP三次握手和四次挥手]]></title><link>https://blog.youkuaiyun.com/qq_36045946/article/details/82818456</link><guid>https://blog.youkuaiyun.com/qq_36045946/article/details/82818456</guid><author>qq_36045946</author><pubDate>Sat, 22 Sep 2018 22:46:04 +0800</pubDate><description><![CDATA[TCP三次握手和四次挥手
各种标志解释
SYN(synchronous建立联机)
ACK(acknowledgement 确认)
PSH(push传送)
FIN(finish结束)
RST(reset重置)
URG(urgent紧急)
Sequence number(顺序号码)
Acknowledge number(确认号码)
状态迁移
客户端TCP状态迁移：
CLOSED-&amp;amp;amp;amp;amp;gt;SYN_SEN...]]></description><category></category></item><item><title><![CDATA[C++STL用法]]></title><link>https://blog.youkuaiyun.com/qq_36045946/article/details/82147177</link><guid>https://blog.youkuaiyun.com/qq_36045946/article/details/82147177</guid><author>qq_36045946</author><pubDate>Tue, 28 Aug 2018 14:22:11 +0800</pubDate><description><![CDATA[C++STL用法

vector

#include &amp;amp;amp;amp;lt;vector&amp;amp;amp;amp;gt;   // 头文件

vector&amp;amp;amp;amp;lt;int&amp;amp;amp;amp;gt; vec // 初始化
vec.push_back(100);// 添加元素
vec.pop_back();// 删除末尾元素
vec.size();// 元素个数
vec.empty();// 判断是否为空
vec[0];// 访问第一个元素
]]></description><category></category></item><item><title><![CDATA[读书笔记 ——《图解HTTP》]]></title><link>https://blog.youkuaiyun.com/qq_36045946/article/details/81416807</link><guid>https://blog.youkuaiyun.com/qq_36045946/article/details/81416807</guid><author>qq_36045946</author><pubDate>Sat, 04 Aug 2018 23:45:12 +0800</pubDate><description><![CDATA[目录

第1章 了解Web及网络基础

第2章 简单的HTTP协议

第3章 HTTP报文内的HTTP信息

第4章 返回结果的HTTP状态码

第6章 HTTP首部

第7章 确保Web安全的HTTPS

第1章 了解Web及网络基础

1.1 TCP/IP简介

TCP/IP是互联网相关的各类协议族的总称

TCP/IP分为4个层

应用层：决定了向用户提供应用服务时通信的活动。TCP/IP协...]]></description><category></category></item><item><title><![CDATA[查找]]></title><link>https://blog.youkuaiyun.com/qq_36045946/article/details/81229119</link><guid>https://blog.youkuaiyun.com/qq_36045946/article/details/81229119</guid><author>qq_36045946</author><pubDate>Thu, 26 Jul 2018 22:51:13 +0800</pubDate><description><![CDATA[目录

静态查找

二叉排序树

平衡二叉树——AVL树


静态查找


1. 顺序表查找

2. 二分查找

3. 插值查找

    核心公式：mid = low + (high - low) * (key - a[low]) / (a[high] - a[low]);

4. 斐波那契查找

    斐波那契查找与折半查找很相似，他是根据斐波那契序列的特点对有序表进行分割的。他要求开始表中...]]></description><category></category></item><item><title><![CDATA[树]]></title><link>https://blog.youkuaiyun.com/qq_36045946/article/details/81185671</link><guid>https://blog.youkuaiyun.com/qq_36045946/article/details/81185671</guid><author>qq_36045946</author><pubDate>Tue, 24 Jul 2018 15:36:03 +0800</pubDate><description><![CDATA[
树的度


结点拥有的子树数称为结点的度。树的度是树内各结点的度的最大值。


树的深度


结点的层数从根开始定义，根为第一层，根的孩子为第二层。树中结点的最大层次称为树的深度或高度。


二叉树的顺序存储结构



#include &quot;stdio.h&quot;    
#include &quot;stdlib.h&quot;   
#include &quot;io.h&quot;  
#include &quot;math.h&quot;  
#incl...]]></description><category></category></item><item><title><![CDATA[串]]></title><link>https://blog.youkuaiyun.com/qq_36045946/article/details/81148997</link><guid>https://blog.youkuaiyun.com/qq_36045946/article/details/81148997</guid><author>qq_36045946</author><pubDate>Sat, 21 Jul 2018 20:54:06 +0800</pubDate><description><![CDATA[目录

串

KMP


串



#include &quot;string.h&quot;
#include &quot;stdio.h&quot;    
#include &quot;stdlib.h&quot;   
#include &quot;io.h&quot;  
#include &quot;math.h&quot;  
#include &quot;time.h&quot;

#define OK 1
#define ERROR 0
#define TRUE 1
#define FAL]]></description><category></category></item><item><title><![CDATA[队列]]></title><link>https://blog.youkuaiyun.com/qq_36045946/article/details/81103363</link><guid>https://blog.youkuaiyun.com/qq_36045946/article/details/81103363</guid><author>qq_36045946</author><pubDate>Wed, 18 Jul 2018 19:11:59 +0800</pubDate><description><![CDATA[目录

循环队列

链队列


 循环队列


队满：(rear + 1) % QueueSize == front

队空：front == rear

队长：(rear - front + QueueSize) % QueueSize


#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;stdlib.h&amp;gt;

#define MAXSIZE 1024
typed...]]></description><category></category></item><item><title><![CDATA[四则运算符表达式求值]]></title><link>https://blog.youkuaiyun.com/qq_36045946/article/details/81090501</link><guid>https://blog.youkuaiyun.com/qq_36045946/article/details/81090501</guid><author>qq_36045946</author><pubDate>Tue, 17 Jul 2018 23:53:08 +0800</pubDate><description><![CDATA[
四则运算符表达式求值


中缀表达式转后缀表达式（栈用来存放运算符号）

从左到右遍历中缀表达式中的每个数字和符号，若是数字就输出，成为后缀表达式的一部分；若是符号，则判断其与栈顶符号的优先级，如果是有括号或者该符号低于栈顶符号(乘除优先加减)，则栈顶元素依此出栈并输出，并将该符号进栈，一直到最后得到后缀表达式。

后缀表达式求值（栈用来存放运算数）

从左到右遍历表达式的每个数字和符号，遇到数...]]></description><category></category></item><item><title><![CDATA[斐波那契数列]]></title><link>https://blog.youkuaiyun.com/qq_36045946/article/details/81086845</link><guid>https://blog.youkuaiyun.com/qq_36045946/article/details/81086845</guid><author>qq_36045946</author><pubDate>Tue, 17 Jul 2018 19:17:58 +0800</pubDate><description><![CDATA[
斐波那契数列



#include &amp;lt;stdio.h&amp;gt;

int Fib(int i)
{
	if (i &amp;lt; 2) {
		return i == 0 ? 0 : 1;
	}
	return Fib(i -1) + Fib(i -2);
}
int main()
{
	printf(&quot;斐波那契数列(迭代实现)\n&quot;);
	int a[40];
	a[0] = 0;
	a[1]...]]></description><category></category></item><item><title><![CDATA[栈]]></title><link>https://blog.youkuaiyun.com/qq_36045946/article/details/81074688</link><guid>https://blog.youkuaiyun.com/qq_36045946/article/details/81074688</guid><author>qq_36045946</author><pubDate>Tue, 17 Jul 2018 08:27:15 +0800</pubDate><description><![CDATA[
顺序栈



#include &amp;lt;stdio.h&amp;gt;

#define MAXSIZE 1024
typedef int ElementType;
typedef struct
{
	ElementType data[MAXSIZE];
	int top;	// 栈顶指针 
}SqStack;

int InitStack(SqStack * S);				// 初始化栈 
int P...]]></description><category></category></item><item><title><![CDATA[链表]]></title><link>https://blog.youkuaiyun.com/qq_36045946/article/details/81073164</link><guid>https://blog.youkuaiyun.com/qq_36045946/article/details/81073164</guid><author>qq_36045946</author><pubDate>Mon, 16 Jul 2018 23:01:00 +0800</pubDate><description><![CDATA[
单链表



// 线性表----链式存储
#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;stdlib.h&amp;gt;

typedef int ElementType; 
typedef struct Node
{
	ElementType data;
	struct Node * next;
} Node;
typedef struct Node * LinkLis...]]></description><category></category></item><item><title><![CDATA[线性表顺序存储]]></title><link>https://blog.youkuaiyun.com/qq_36045946/article/details/81050972</link><guid>https://blog.youkuaiyun.com/qq_36045946/article/details/81050972</guid><author>qq_36045946</author><pubDate>Sun, 15 Jul 2018 11:45:23 +0800</pubDate><description><![CDATA[
时间复杂度效率


O(1) &amp;gt; O(logn) &amp;gt; O(n) &amp;gt; O(nlogn) &amp;gt; O(n^2) &amp;gt; O(n^3) &amp;gt; O(2^n) &amp;gt; O(n!) &amp;gt; O(n^n) 


线性表顺序存储



// 线性表----顺序存储 
#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;stdlib.h&amp;gt;

#defin...]]></description><category></category></item><item><title><![CDATA[PHP设计模式]]></title><link>https://blog.youkuaiyun.com/qq_36045946/article/details/80979521</link><guid>https://blog.youkuaiyun.com/qq_36045946/article/details/80979521</guid><author>qq_36045946</author><pubDate>Tue, 10 Jul 2018 00:46:34 +0800</pubDate><description><![CDATA[目录

工厂模式(Factory Pattern)

单例模式(Singleton Pattern)

注册树模式

适配器模式(Adapter Pattern)

策略模式(Strategy Pattern)

数据对象映射模式

观察者模式(Observer Pattern)

原型模式(Prototype Pattern)

装饰者模式(Decorator Pattern)

迭代器模式(I...]]></description><category></category></item><item><title><![CDATA[MongoDB入门]]></title><link>https://blog.youkuaiyun.com/qq_36045946/article/details/80858733</link><guid>https://blog.youkuaiyun.com/qq_36045946/article/details/80858733</guid><author>qq_36045946</author><pubDate>Fri, 29 Jun 2018 16:30:53 +0800</pubDate><description><![CDATA[1.启动与停止Linux启动：bin/mongod -f mongodb.conf连接：bin/mongo 127.0.0.1:27017/db_name停止：use admin;     db.shutdownServer();      或    kill -15 pid]]></description><category></category></item><item><title><![CDATA[经典排序算法(PHP语言实现)]]></title><link>https://blog.youkuaiyun.com/qq_36045946/article/details/80751831</link><guid>https://blog.youkuaiyun.com/qq_36045946/article/details/80751831</guid><author>qq_36045946</author><pubDate>Wed, 20 Jun 2018 19:49:58 +0800</pubDate><description><![CDATA[目录

1.1冒泡排序(BubbleSort)

1.2鸡尾酒排序(CocktailSort)

2.选择排序(SelectionSort)

3.1插入排序——直接插入排序(StraightInsertionSort)

3.2插入排序——二分查找排序(BinarySearchSort)

3.3插入排序——希尔排序(ShellSort)

4.归并排序(MergeSort)

5.堆排序(He...]]></description><category></category></item><item><title><![CDATA[Redis入门]]></title><link>https://blog.youkuaiyun.com/qq_36045946/article/details/80723814</link><guid>https://blog.youkuaiyun.com/qq_36045946/article/details/80723814</guid><author>qq_36045946</author><pubDate>Mon, 18 Jun 2018 13:44:37 +0800</pubDate><description><![CDATA[1.什么是RedisRedis是远程的、基于内存的、非关系型数据库2.Redis的使用场景]]></description><category></category></item><item><title><![CDATA[Mysql基础知识]]></title><link>https://blog.youkuaiyun.com/qq_36045946/article/details/80469314</link><guid>https://blog.youkuaiyun.com/qq_36045946/article/details/80469314</guid><author>qq_36045946</author><pubDate>Sun, 27 May 2018 14:47:10 +0800</pubDate><description><![CDATA[1.mysql启动/停止/重启win：(管理员模式下) 启动：net start mysql停止：net stop mysqllinux启动：service mysqld start停止：service mysqld stop重启：service mysqld restart2.mysql语句规范关键字和函数名全部大写数据库名称、表名称、字段名称全部小写SQL语句必须以分号结尾3.创建数据表CRE...]]></description><category></category></item></channel></rss>