Zelda256-CSDN博客

原创中文汉字按拼音排序，通讯录排序，中英混杂排序

中文汉字按拼音排序，通讯录排序，中英混杂排序直接上代码const sorter = (strA, strB) => { const reg = /^[a-zA-Z0-9]/; // 是否純数字或純英文 if (reg.test(strA) || reg.test(strB)) { if (strA > strB) { return 1; } else if (strA < strB) { return -1;

2021-01-06 12:04:15 273

翻译 JavaScript的5个技巧帮助你写出更好的条件语句

使用JavaScript时，我们会遇到很多的条件语句，这里有5个技巧能帮助你写出更好/简洁的条件语句。对多个条件使用Array.includes更少嵌套，尽早return使用默认的函数参数和解构支持Map / Object 语法而不是Switch语句对所有/部分标准使用Array.every和Array.some总结1. 对多个条件使用Array.includes先看看下面...

2018-11-16 12:08:45 376 1

原创为什么TCP是三次握手和四次挥手

三次握手过程：A---------->B，A向B发起建立连接请求B---------->A，B收到A的发送信号，并且向A发送确认信息A---------->B，A收到B的确认信号，并且向B发送确认信号通过第一次握手，B知道A能够发送数据；通过第二次握手，A知道B能够发送数据；结合第一次握手和第二次握手，A知道B能够接受数据；结合第三次握手，B知道A能够接收数据；...

2018-11-16 12:03:06 289

原创 RESTful总结

什么是RESTful REST，即Representational State Transfer的缩写。（表现层的状态转换）。表现层就是资源的表现形式。资源可以是图片、html、txt、网络上可获取的对象，URI代表资源。如果一个架构符合REST原则，就称它为RESTful架构。RESTful的设计误区 URI中包含动词协议 HTTPs域名 · 将API放在主域名下 ht...

2018-08-17 10:31:09 631

原创 JS自动插入分号规则

首先应该知道哪些语句会用到自动插入分号(Automatic Semisolon Insertion, ASI)： - 空语句 - var 语句 - 表达式 - do-while 语句 - continue 语句 - break 语句 - return 语句 - throw 语句ASI的具体规则，在此规范中描述：§11.9.1 Rules of Automatic Semicol...

2018-08-17 10:27:18 1091

原创【数据结构】算法10.15-10.17 链式基数排序

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1typedef int Status;typedef int ElemType;#define MAX_NUM_OF_KEY 8

2016-10-11 14:24:05 1422

原创【数据结构】算法10.11-10.14 2-路归并排序

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define EQ(a,b) ((a) == (b))#define LT(a,b)

2016-10-11 14:22:55 839

原创【数据结构】算法10.10-10.11 堆排序

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define EQ(a,b) ((a) == (b))#define LT(a,b)

2016-10-11 14:22:03 612

原创【数据结构】算法10.9 选择排序-简单选择排序

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define EQ(a,b) ((a) == (b))#define LT(a,b)

2016-10-11 14:21:04 927

原创【数据结构】算法10.6-10.8 快速排序

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define EQ(a,b) ((a) == (b))#define LT(a,b)

2016-10-11 14:20:16 1583

原创【数据结构】算法10.4-10.5 插入排序-希尔

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int ElemType;typ

2016-10-11 14:17:36 815

原创【数据结构】算法10.3 插入排序-表插入

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define MAXINT -1#define EQ(a,b) ((a) == (b)

2016-10-11 14:16:12 426

原创【数据结构】算法10.2 插入排序-折半插入

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define EQ(a,b) ((a) == (b))#define LT(a,b)

2016-10-11 14:15:22 696

原创【数据结构】算法10.1 插入排序-直接插入

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define EQ(a,b) ((a) == (b))#define LT(a,b)

2016-10-10 21:52:38 814

原创【数据结构】算法9.17-9.18 哈希表-插入&查找

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int KeyType;type

2016-10-10 21:51:37 608

原创【数据结构】算法9.16 键树-Trie树-查找

#include<stdio.h>#include<string.h>#include<stdlib.h>#include<ctype.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define MAXKEYLEN 16typedef int Status;typed

2016-10-10 21:50:40 435

原创【数据结构】算法9.15 键树-双链树-查找

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int ElemType;#def

2016-10-10 21:50:03 632

原创【数据结构】算法9.13-9.14 B树-插入&查找

#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW_SELF -2#define EQ(a,b) ((a) ==

2016-10-10 21:49:21 424

原创【数据结构】算法9.9-9.12 平衡二叉树

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define EQ(a,b) ((a) == (b))#define LT(a,b)

2016-10-10 21:48:25 567

原创【数据结构】算法9.5-9.8 二叉排序树

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define EQ(a,b) ((a) == (b))#define LT(a,b)

2016-10-10 21:47:35 708

原创【数据结构】算法9.3-9.4 静态树表-构造次优查找树

#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define LIST_INIT_SIZE 100 //存储空间的初始分配量typedef

2016-10-10 21:46:47 732

原创【数据结构】算法9.2 有序表查找-折半查找

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define LIST_INIT_SIZE 100 //存储空间的初始分配量#defin

2016-10-10 21:45:56 1330

原创【数据结构】算法9.1 顺序表查找-顺序查找

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define LIST_INIT_SIZE 100 //存储空间的初始分配量#defin

2016-10-10 21:45:07 1229

原创【数据结构】算法8.3 广义表遍历算法

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int ElemType;#def

2016-10-10 21:44:00 2161

原创【数据结构】算法8.2 伙伴系统-分配

#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW_SELF -2#define M 3 //可利用空间总容

2016-10-10 21:43:15 1362

原创【数据结构】算法8.1 边界标识法-分配

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define MAX 1000#define E 10#define FootLoc

2016-10-10 21:42:21 1012

原创【数据结构】算法7.16 Floyd算法各对顶点间最短路径

这个程序输出路径的时候有点问题。#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define MAX 20 //最大顶点个数#d

2016-10-10 21:41:05 603

原创【数据结构】算法7.15 Dijkstra算法单源点最短路径

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define MAX_VERTEX_NUM 20 //最大顶点个数#define

2016-10-10 21:39:54 797

原创【数据结构】算法7.13-7.14 AOE-网关键路径

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int ElemType;typ

2016-10-10 21:38:48 790

原创【数据结构】算法7.12 AOV-网拓扑排序

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int ElemType;typ

2016-10-10 21:31:46 786

原创【数据结构】算法7.10-7.11 DFS求无向图关节点

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int ElemType;typ

2016-10-10 21:27:00 1346

原创【数据结构】算法7.9 普里姆算法-无向网最小生成树

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int ElemType;#def

2016-10-10 21:18:59 1244

原创【数据结构】算法7.7-7.8 无向图的连通分量和生成树

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define MAXSIZE 20 //最大顶点数typedef int Statu

2016-10-10 21:13:21 1811

原创【数据结构】算法7.6 广度优先搜索

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int ElemType;typ

2016-10-10 21:12:17 506

原创【数据结构】算法7.4-7.5 深度优先搜索

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define MAX 20#define INFINITY 65535 //最大

2016-10-10 21:10:54 642

原创【数据结构】算法7.3 图的存储结构-十字链表

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define MAX_VERTEX_NUM 20 //最大顶点个数typedef in

2016-10-10 21:05:57 608

原创【数据结构】算法7.1-7.2 图的存储结构-数组表示法

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define INFINITY 65535 //最大值∞#define MAX_

2016-10-10 21:04:47 1299

原创【数据结构】算法6.16 N皇后问题

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2//直接修改N可算不同N值的N皇后问题#define N 4typedef int S

2016-10-10 21:02:04 844

原创【数据结构】算法6.14-6.15 回溯法与树的遍历

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;// 6.15 是 6.14 的求精后的算法，只完成

2016-10-10 20:57:57 506

原创【数据结构】算法6.12-6.13 求赫夫曼编码

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef struct{ unsi

2016-10-10 20:56:29 1099

socket.io实现的在线聊天程序DEMO

数据结构严蔚敏版 建立词索引表

C语言课程设计 通讯录管理系统

模拟x86 cpu的软件

js用post上传数据到服务器，responseText返回错误

数据结构严蔚敏版建立词索引表

C语言课程设计通讯录管理系统