/tags/%E7%AE%97%E6%B3%95/ Recent content in 算法 on 赵裕的博客 Hugo -- gohugo.io zh-cn Thu, 30 Jul 2026 15:32:42 +0800 /articles/cpp-function-callstack-backtrace-1/ Sun, 10 Apr 2022 00:00:00 +0000 /articles/cpp-function-callstack-backtrace-1/ 背景 之前在解决一个Flutter Engine的C++ Crash问题时，就曾受困于一个问题：如何回溯C++的 函数调用栈？最近频繁使用C++的过程中，这个诉求日益突出。 遂下定决心彻底解决之。 过程 在stac /articles/mei-ri-yi-ti-a-regular-expression-matcher/ Fri, 09 Feb 2018 00:00:00 +0000 /articles/mei-ri-yi-ti-a-regular-expression-matcher/ 每日一题：A Regular Expression Matcher 选自Beautiful Code第一章：A Regular Expression Matcher。 Task & Background (节选自Beautiful Code) In 1998, Rob Pike and I were writing The Practice of Programming (Addison-Wesley). The last chapter of the book, “Notation,” collected a number of examples where good notation led to better programs and better /articles/mei-ri-yi-ti-100-doors/ Wed, 07 Feb 2018 00:00:00 +0000 /articles/mei-ri-yi-ti-100-doors/ 每日一题：100 doors 选自100 doors - Rosetta Code Task There are 100 doors in a row that are all initially closed.You make 100 passes by the doors.The first time through, visit every door and toggle the door (if the door is closed, open it;if it is open, close it).The second time, only visit every 2nd door(door #2, #4, #6, …),and toggle it.The third time, visit every 3rd door(door #3, #6, #9, …), etc,until you only visit the 100th door. Answer the question: what state are the doors in after the /articles/shi-jian-fu-za-du-ji-suan-lei-ti-mu-liang-ze/ Sat, 25 Mar 2017 00:00:00 +0000 /articles/shi-jian-fu-za-du-ji-suan-lei-ti-mu-liang-ze/ 时间复杂度计算类题目两则 本文记录了两则具有代表性的算法复杂度计算题目。 题目1 分析以下代码的时间复杂度: for (int i = 0; i < n; i++) { for (int j = 0; j < i; j++) { for (int k = 0; k < j; k++) { // operations } } } 注：以上代码只作示意，未详细 /articles/wai-pai-xu/ Mon, 20 Mar 2017 00:00:00 +0000 /articles/wai-pai-xu/ 外排序 初探如何对大规模数据进行排序。 问题 问题描述很简单，如何对大规模数据进行排序，比如说一个30G的文件。 分析 解决这个问题主要要解决两件事。第一件就是大文件显然无法一次读入内存，所以只能一次读入一部分 /articles/2016-poj3484-showstopper-two-points/ Sun, 21 Aug 2016 00:00:00 +0000 /articles/2016-poj3484-showstopper-two-points/ 题目地址 二分用的很是巧妙！关键是抽象出问题本质。 1 #include <cstdio> 2 #include <string> 3 #include <cstring> 4 const int maxn = 100000; 5 #define ull unsigned long long 6 ull X[maxn], Y[maxn], Z[maxn], C[maxn]; 7 ull N; 8 ull judge(const ull &mid) { 9 ull sum = 0; 10 for (int i = 0; i < N; i++) { 11 if (mid >= Y[i]) { 12 sum += C[i]; 13 } else if (mid >= X[i]) { 14 sum += ((mid-X[i])/Z[i]+1); 15 } /articles/2016-uva1555-garland-derivation-two-points/ Sun, 21 Aug 2016 00:00:00 +0000 /articles/2016-uva1555-garland-derivation-two-points/ 题意：有n个灯，给定第一盏灯A的高度，接下去每盏灯的高度按照公式计算，求使所有灯都不会落在地上（允许碰触）的B的最低高度。 uva 输出 double 用 %f，这一波坑的！ 1 #include <cstdio> 2 int n; 3 double A, B, a[1005]; 4 //h2的值 5 bool check(double x) { 6 a[2] /articles/2016-poj-3662-telephone-lines-two-points-shortest-path/ Sat, 20 Aug 2016 00:00:00 +0000 /articles/2016-poj-3662-telephone-lines-two-points-shortest-path/ 查看题目 最小化第K大值。 让我怀疑人生的一题目，我有这么笨？ 1 #include <cstdio> 2 #include <queue> 3 #include <cstring> 4 #include <vector> 5 #include <functional> 6 using namespace std; 7 #define maxv 1010 8 #define maxl 1000000 9 struct edge 10 { 11 int to, cost; 12 edge(){} 13 edge(int to, int cost) : to(to), cost(cost){} 14 }; 15 typedef pair<int, int> P; 16 vector<edge> G[maxv]; 17 int d[maxv]; 18 int V, E; 19 int dij(int s, int x) { 20 /articles/2016-poj2010-moo-university-financial-aid-dichotomy/ Fri, 19 Aug 2016 00:00:00 +0000 /articles/2016-poj2010-moo-university-financial-aid-dichotomy/ 题目地址 分析：如果用二分法，关键是score和aid分开排序，score排序是为了充分利用中位数的性质，这样就可以确定m左右必须各选N/2个，到这之后有人是用dp求最优解，可以再次按照aid排序一次， /articles/2016-poj-2976-dropping-tests-maximizing-the-mean-or-01-integer-programming/ Mon, 15 Aug 2016 00:00:00 +0000 /articles/2016-poj-2976-dropping-tests-maximizing-the-mean-or-01-integer-programming/ 题目链接 忽略运算符逻辑导致奇怪的错误（代码中指明位置了） 输出没加0.5，WA。 还有，注意特殊情况k=0,所以scanf("%d%d", &n, &k)&n就够了， scanf("%d%d", &n, &am /articles/2016-poj3258-river-hopscotch/ Sat, 13 Aug 2016 00:00:00 +0000 /articles/2016-poj3258-river-hopscotch/ 地址 别人的代码，自己边界总是控制不好，还不知道哪里错了！思维！这种问题代码越简洁反而越不容易错吧。。 1 #include<stdio.h> 2 #include<algorithm> 3 typedef long long ll; 4 using namespace std; 5 ll n,m,L,a[100010]; 6 bool bi(ll x){ 7 ll i,cnt=0,now=0; 8 for(i=1;i<=n;i++){ 9 if(a[i]-a[now]<=x)cnt++; 10 else now=i; 11 } 12 if(L-a[now]<x)return 0; 13 return cnt<=m; 14 } 15 int main(){ 16 ll i,l,r,mi; 17 while(~scanf("%lld%lld%lld",&L,&n,&m)){ 18 l=0;r=L; /articles/2016-poj3273-monthly-expense/ Sat, 13 Aug 2016 00:00:00 +0000 /articles/2016-poj3273-monthly-expense/ 查看原题 边界，就是边界和思维，怎么有效的判断中间值是大了还是小了，以及准确的找到边界！一个<写成<=就前功尽弃，还特别难找到错误！ 1 #include <cstdio> 2 #include <algorithm> 3 const int maxN = 100005; 4 int N, M; 5 int A[maxN]; 6 using namespace std; 7 int main(void) { 8 while /articles/2016-poj-2457-part-acquisition/ Fri, 12 Aug 2016 00:00:00 +0000 /articles/2016-poj-2457-part-acquisition/ 第一反应是BFS,比较直观，但是输出路径写的不是很熟练，此外，习惯不好，“==”写成了“=”，所以常量一定放前面！ 1 #include <cstdio> 2 #include <queue> 3 #include <cstring> 4 using namespace std; 5 int N, K; 6 typedef struct node 7 { 8 int in, out; 9 int pos; 10 }Link; 11 const int maxn = 50005; 12 bool vis[maxn]; 13 Link /articles/2016-poj2456-aggressive-cows/ Fri, 12 Aug 2016 00:00:00 +0000 /articles/2016-poj2456-aggressive-cows/ Aggressive cows 二分，关键是转化为二分！ 1 #include <cstdio> 2 #include <algorithm> 3 const int maxn = 1000000005; 4 const int maxN = 100005; 5 6 int N, C; 7 int a[maxN]; 8 using namespace std; 9 bool judge(int x) { 10 int s = 0; 11 for (int i = 1; i < C;i++) { 12 int ctr = s+1; 13 while (ctr < N && (a[ctr]-a[s] < x)) { 14 ctr++; 15 } 16 if (ctr==N) { 17 return false; 18 } 19 s = ctr; 20 } 21 return /articles/2016-gcd-xor-acm-icpc-dhaka-2013-uva12716/ Tue, 09 Aug 2016 00:00:00 +0000 /articles/2016-gcd-xor-acm-icpc-dhaka-2013-uva12716/ 不同的枚举方法，效率完全不同。值得记录一下！ 1 #include <cstdio> 2 #include <cstring> 3 int t, a, b, c, n, cas = 0, count = 0; 4 int cnt[30000000]; 5 void pre() { 6 count = 0; 7 memset(cnt, 0, sizeof(cnt)); 8 9 for (a = 1; a <= 30000000; a++) { 10 for (c = 1; c < a; c++) { 11 if (a%c == 0 && ((a-c)^a)==c) { 12 count++; 13 } 14 } 15 cnt[a-1] = count; 16 } 17 18 } /articles/2016-irrelevant-elements-acm-icpc-neerc-2004-uva1635/ Tue, 09 Aug 2016 00:00:00 +0000 /articles/2016-irrelevant-elements-acm-icpc-neerc-2004-uva1635/ 这种题目最重要的是思路了清晰 1 #include <cstdio> 2 #include <cstring> 3 const int maxn = 100005;//sqrt(n)+1 is enough 4 5 int fac[100][2]; 6 int fac_c[100]; 7 int a[maxn]; 8 void factor(int m) { 9 int& num = fac[0][0]; 10 num = 0; 11 for (int i = 2; i*i <= m; i++) { 12 if(m%i == 0) { 13 fac[++num][0] = i; 14 fac[num][1] = 0; 15 do { 16 fac[num][1]++; 17 m/= i; 18 } while(m%i == 0); 19 } 20 } 21 if (m > 1) { 22 /articles/2016-examples-of-chapter-7-of-the-purple-book-violent-solution-method/ Tue, 26 Jul 2016 00:00:00 +0000 /articles/2016-examples-of-chapter-7-of-the-purple-book-violent-solution-method/ 1.除法（Division, UVa 725） #include <cstdio> #include <cstring> bool isOk(int a, int b){ char buff[20]; int visited[15]; memset(visited, 0, sizeof(visited)); sprintf(buff, "%05d%05d", a, b); for (int i =0; i < 10; i++){ int temp = buff[i] - '0'; if (0 == visited[temp]){ visited[temp]++; } else { return false; } } return true; } int main(void){ int N, cnt = 0; bool flag = false; for (;scanf("%d", &N) && N;){ if (cnt > 0){ printf("\n"); } cnt++; flag = false; for (int i = 1234; i< /articles/2016-a-brief-analysis-of-the-elementary-snake-ai-algorithm/ Thu, 14 Jul 2016 00:00:00 +0000 /articles/2016-a-brief-analysis-of-the-elementary-snake-ai-algorithm/ 作为小学期程序设计训练大作业的一部分，也是自己之前思考过的一个问题，终于利用小学期完成了贪吃蛇AI的一次尝试，下作一总结。 背景介绍： 首先，我针对贪吃蛇AI这一关键词在百度和google上尽心了检索，大 /articles/2016-data-structure-algorithm-c-language-implementation-32-9-1-static-lookup-table/ Tue, 12 Jul 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-32-9-1-static-lookup-table/ 一、简述 静态查找表又分为顺序表、有序表、静态树表和索引表。以下只是算法的简单实现及测试，不涉及性能分析。 二、头文件 1 /** 2 author：zhaoyu 3 date:2016-7-12 4 */ 5 #include "6_3_part1_for_chapter9.h" 6 typedef struct { 7 int key; 8 }SElemType; 9 //静态查找表的顺序 /articles/2016-data-structures-and-basic-methods-in-machine-games-2-examples-of-recursion-and-backtracking-methods/ Mon, 04 Jul 2016 00:00:00 +0000 /articles/2016-data-structures-and-basic-methods-in-machine-games-2-examples-of-recursion-and-backtracking-methods/ 1、跳马问题：从左上角开始，按照象棋中马的行走规则（但是不考虑马脚，只需要按日字走），要求每个点走一次且仅一次，并且所有的点走走到，求解所有可行走法。 思路及代码： 1 #include <cstdio> 2 int a[9][9]; //包含边界拓展 3 int S = 0; /articles/2016-data-structure-and-basic-methods-in-machine-games-1-summary/ Mon, 04 Jul 2016 00:00:00 +0000 /articles/2016-data-structure-and-basic-methods-in-machine-games-1-summary/ 一、基本概念 博弈分类：单人博弈（华容道）、双人博弈（象棋、围棋）、多人博弈（麻将、桥牌）；完全信息博弈（象棋、围棋）、不完全信息博弈（麻将、桥牌、三国杀等）。 注：大一曾选修过一门课：博弈论，也在数模班 /articles/2016-a-brief-analysis-of-the-basic-ai-backgammon-algorithm/ Sun, 03 Jul 2016 00:00:00 +0000 /articles/2016-a-brief-analysis-of-the-basic-ai-backgammon-algorithm/ 五子棋是所有棋类博弈中比较简单的了，这里介绍的也只是一种非常基本的AI策略。其实，包括之前的AI贪吃蛇，感觉这两个AI其实体现的都是一种建模思想，把一个现实中的问题模型化，抽象化，得到其一般特征，再设 /articles/2016-data-structure-algorithm-c-language-implementation-28-7-4-graph-connectivity-issues/ Sun, 19 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-28-7-4-graph-connectivity-issues/ 一.简述 coding /articles/2016-data-structure-algorithm-c-language-implementation-22-6-4-trees-and-forests/ Sun, 19 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-22-6-4-trees-and-forests/ 一.简述 coding /articles/2016-data-structure-algorithm-implementation-in-c-language-29-7-5-directed-acyclic-graph-and-its-applicat/ Sun, 19 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-implementation-in-c-language-29-7-5-directed-acyclic-graph-and-its-applicat/ 一.简述 /articles/2016-data-structure-algorithm-c-language-implementation-26-7-2-storage-structure-of-graph/ Sun, 19 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-26-7-2-storage-structure-of-graph/ 一.简述 coding /articles/2016-data-structure-algorithm-c-language-implementation-27-7-2-graph-traversal/ Sun, 19 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-27-7-2-graph-traversal/ 一.简述 栈与队列，DFS与BFS。仅以连接表为例实现。 二.头文件 BFS要用到的头文件 1 //3_4_part1.h 2 /** 3 author:zhaoyu 4 email:zhaoyu1995.com@gmail.com 5 date:2016-6-9 6 2016-6-25修改版，针对第七章 7 note:realize my textbook <<数据结构（C语言版）>&gt /articles/2016-implementation-of-data-structure-algorithm-in-c-language-twenty-three-6-5-trees-and-equivalence-prob/ Sun, 19 Jun 2016 00:00:00 +0000 /articles/2016-implementation-of-data-structure-algorithm-in-c-language-twenty-three-6-5-trees-and-equivalence-prob/ 一.简述 /articles/2016-data-structure-algorithm-c-language-implementation-24-6-6-huffman-tree-and-its-application/ Sun, 19 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-24-6-6-huffman-tree-and-its-application/ 一.简述 coding /articles/2016-data-structure-algorithm-c-language-implementation-25-6-7-backtracking-method-and-tree-traversal/ Sun, 19 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-25-6-7-backtracking-method-and-tree-traversal/ 一.简述 coding /articles/2016-data-structure-algorithm-c-language-implementation-21-6-3-2-clue-binary-tree/ Sun, 19 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-21-6-3-2-clue-binary-tree/ 一.简述 coding /articles/2016-data-structure-algorithm-c-language-implementation-30-7-6-shortest-path/ Sun, 19 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-30-7-6-shortest-path/ 一.简述 /articles/2016-data-structure-algorithm-c-language-implementation-31-8-3-boundary-marking-method/ Sun, 19 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-31-8-3-boundary-marking-method/ 一.简述 /articles/2016-data-structure-algorithm-implemented-in-c-language-20-6-3-1-traversing-the-binary-tree/ Sat, 18 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-implemented-in-c-language-20-6-3-1-traversing-the-binary-tree/ 一.简述 二叉树的遍历主要是先序、中序、后序及对应的递归和非递归算法，共3x2=6种，其中后序非递归在实现上稍复杂一些。二叉树的遍历是理解和学习递归及体会栈的工作原理的绝佳工具！ 此外，非递归所用的栈及相 /articles/2016-data-structure-algorithm-c-language-implementation-18-5-3-compressed-storage-of-matrices/ Fri, 17 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-18-5-3-compressed-storage-of-matrices/ 一.简述 【coding】 /articles/2016-data-structure-algorithm-c-language-implementation-19-5-5-5-6-5-7-generalized-table/ Fri, 17 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-19-5-5-5-6-5-7-generalized-table/ 一.简述 传说Lisp的基本数据结构就是广义表，广义表也是具有典型递归属性的数据结构，此外，由于建表要处理字符串，用C语言处理起来也是一脸懵逼…..最后自己还想写一个将广义表还原成字符串的 /articles/2016-data-structure-algorithm-c-language-implementation-seventeen-5-1-5-2-array-definition-sequential-rep/ Wed, 15 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-seventeen-5-1-5-2-array-definition-sequential-rep/ 一.简述 理解数组位置的计算公式 LOC(j1, j2, ···, jn) = LOC(0, 0, ..., 0) + (b2x ··· x bnx j1 + b3x ··· x bnx j2 + ··· + bnx jn-1 + jn)L 化简为 可以缩写成 其中 cn = L,ci-1 = bi x ci, 1<i≤n。 二.头文件 1 //5_2.h 2 /** 3 author:zhaoyu 4 date:2016-6-15 5 */ 6 //---- /articles/2016-implementation-of-data-structure-algorithm-in-c-language-16-4-3-application-examples-of-strings/ Fri, 10 Jun 2016 00:00:00 +0000 /articles/2016-implementation-of-data-structure-algorithm-in-c-language-16-4-3-application-examples-of-strings/ 一.简述 【coding】 /articles/2016-data-structure-algorithm-c-language-implementation-13-3-5-discrete-event-simulation/ Fri, 10 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-13-3-5-discrete-event-simulation/ 一.简述 【coding】 /articles/2016-data-structure-algorithm-c-language-implementation-14-4-1-4-2-string-type-definition-representation/ Fri, 10 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-14-4-1-4-2-string-type-definition-representation/ 一.简述 【暂无】 二.头文件 1 //4_2_part1.h 2 /** 3 author:zhaoyu 4 */ 5 //2016-6-10 6 //----串的定长顺序存储表示---- 7 #include "head.h" 8 #define MAXSTRLEN 255//用户可以在255以内定义最大串长 9 //这语法还不是很熟悉 10 typedef unsigned char SString[MAXSTRLEN+1];//0 号单元存放串的长度 11 int StrLength(SString /articles/2016-data-structure-algorithm-implementation-in-c-language-15-4-3-string-pattern-matching-algorithm/ Fri, 10 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-implementation-in-c-language-15-4-3-string-pattern-matching-algorithm/ 一.简述 【coding】 /articles/2016-data-structure-algorithm-c-language-implementation-12-3-4-sequential-representation-and-implementati/ Thu, 09 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-12-3-4-sequential-representation-and-implementati/ 一.简述 空队列的处理方法：1.另设一个标志位以区别队列是空还是满；2.少用一个元素空间，约定以队列头指针在队尾指针下一位置上作为队列呈满的状态的标志。 二.头文件 1 //3_4_part1.h 2 /** 3 author:zhaoyu 4 email:zhaoyu1995.com@gmail.com 5 date:2016-6-9 6 note:realize my textbook <&l /articles/2016-data-structure-algorithm-c-language-implementation-11-3-4-chain-representation-and-implementation-of/ Thu, 09 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-11-3-4-chain-representation-and-implementation-of/ 一.简介 FIFO。 二.头文件 1 //3_4_part1.h 2 /** 3 author:zhaoyu 4 email:zhaoyu1995.com@gmail.com 5 date:2016-6-9 6 note:realize my textbook <<数据结构（C语言版）>> 7 */ 8 //Page 61 9 #include <cstdio> 10 #include "head.h" 11 #define QElemType int 12 //----单链队列：队列的链式存储结构---- 13 typedef struct QNode{ 14 QElemType /articles/2016-data-structure-algorithm-c-language-implementation-8-3-2-stack-application-examples-maze-solving-and/ Wed, 08 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-8-3-2-stack-application-examples-maze-solving-and/ 一.简介 迷宫求解：类似图的DFS。具体的算法思路可以参考书上的50、51页，不过书上只说了粗略的算法，实现起来还是有很多细节需要注意。大多数只是给了个抽象的名字，甚至参数类型，返回值也没说的很清楚，所 /articles/2016-data-structure-algorithm-c-language-implementation-9-expansion-ai-snake-derived-from-the-maze-proble/ Wed, 08 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-9-expansion-ai-snake-derived-from-the-maze-proble/ 一.简述 【开发中】由于期末时间有限，而且要用到后面的最短路径（可能），所以打算小学期在实现这一部分 /articles/2016-data-structure-algorithm-c-language-implementation-10-3-3-implementation-of-stack-and-recursion/ Wed, 08 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-10-3-3-implementation-of-stack-and-recursion/ 一.简介 汉诺塔问题是递归的一个典型例子，而且书上的讲解很详细，对理解C语言函数及函数传参的工作机制很有帮助，值得一看。而且，递归在我看来和分治、DP、贪心等一样是十分优美的思想，值得学习！！！ 二.CP /articles/2016-data-structure-algorithm-c-language-implementation-6-2-4-representation-and-addition-of-one-variable/ Tue, 07 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-6-2-4-representation-and-addition-of-one-variable/ 一.简述 利用链表表示稀疏多项式，并基于之前的一些操作（编程实现上还是有所不同的）组合新的操作实现一元多项式的表示及相加。 二.ADT 1 抽象数据类型一元多项式的定义 2 ADT Polyomail{ 3 数据对象：D = {a[i]|a[i /articles/2016-data-structure-algorithm-c-language-implementation-7-3-1-linear-implementation-and-application-examp/ Tue, 07 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-7-3-1-linear-implementation-and-application-examp/ 一.简述 栈，LIFO。是操作受限的线性表，和线性表一样有两种存储表示方法。下面以顺序存储为例，实现。 二.ADT 暂无。 三.头文件 1 //3_1.h 2 /** 3 author:zhaoyu 4 email:zhaoyu1995.com@gmail.com 5 date:2016-6-7 6 note:realize my textbook <<数据结构（C语言版）>& /articles/2016-data-structure-algorithm-c-language-implementation-3-2-3-static-linked-list-of-linked-representation/ Mon, 06 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-3-2-3-static-linked-list-of-linked-representation/ 一.简述 【】 /articles/2016-implementation-of-data-structure-algorithm-in-c-language-4-2-3-circular-linked-list-and-doubly-linke/ Mon, 06 Jun 2016 00:00:00 +0000 /articles/2016-implementation-of-data-structure-algorithm-in-c-language-4-2-3-circular-linked-list-and-doubly-linke/ 一.简述 【工作中…】 /articles/2016-data-structure-algorithm-c-language-implementation-5-2-3-redefining-linear-linked-lists-and-their-ba/ Mon, 06 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-5-2-3-redefining-linear-linked-lists-and-their-ba/ 一.简述 …由于链表在空间的合理利用上和插入、删除时不需要移动等的优点，因此在很多场合下，它是线性表的首选存储结构。然而，它也存在着实现某些基本操作，如求线性表的长度时不如顺序存储结构的缺 /articles/2016-data-structure-algorithm-c-language-implementation-2-2-3-linked-representation-of-linear-list-and-im/ Sun, 05 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-2-2-3-linked-representation-of-linear-list-and-im/ 一.简述 【暂无】 二.头文件 1 #ifndef _2_3_part1_H_ 2 #define _2_3_part1_H_ 3 //2_3_part1.h 4 /** 5 author:zhaoyu 6 email:zhaoyu1995.com@gmail.com 7 date:2016-6-4 8 note:realize my textbook <<数据结构（C语言版）>> 9 */ 10 //----线性表的单链表存储结构---- 11 /** 12 My Code 13 to make the paragram run correctlly 14 */ 15 #define ElemType /articles/2016-data-structure-algorithm-c-language-implementation-preface/ Sat, 04 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-preface/ 期末考试即将到来，打算花两周时间实现书上所有的算法。巩固学习成果（其实之前也没怎么听课……）毕竟考前突击，背背，ppt刷个90+是没多大意义的。 没错，就是下面这本 毕竟书也是 /articles/2016-data-structure-algorithm-c-language-implementation-1-2-2-sequential-representation-and-implementatio/ Sat, 04 Jun 2016 00:00:00 +0000 /articles/2016-data-structure-algorithm-c-language-implementation-1-2-2-sequential-representation-and-implementatio/ 注意： 虽然是用C语言实现，但是考虑到使用了一个C++的特性—-引用以简化代码，所以所有的代码均以cpp作为后缀，用g++编译（以后不做说明）。 g++版本： 一.简述 本节主要讲述线性表的顺序实 /articles/2016-cantor-three-episodes/ Fri, 01 Apr 2016 00:00:00 +0000 /articles/2016-cantor-three-episodes/ 值得一提的是，第一次听说cantor三分集是在数字电路课上，然而数电是我最不喜欢的课程之一。。。。。。 分形大都具有自相似、自仿射性质，所以cantor三分集用递归再合适不过了，本来不想用matlab的 /articles/2016-poj-question-classification-reprinted/ Mon, 21 Mar 2016 00:00:00 +0000 /articles/2016-poj-question-classification-reprinted/ Log 2016-3-21 网上找的POJ分类，来源已经不清楚了。百度能百度到一大把。贴一份在博客上，鞭策自己刷题，不能偷懒！！ 初期: 一.基本算法: (1)枚举. (poj1753,poj2965) (2)贪心(poj1328,poj2109,poj2586) ( /articles/2015-minimum-spanning-tree-problem-prim-algorithm-and-kruskal-algorithm-implementation-matlab-language-im/ Fri, 18 Dec 2015 00:00:00 +0000 /articles/2015-minimum-spanning-tree-problem-prim-algorithm-and-kruskal-algorithm-implementation-matlab-language-im/ 2015-12-17晚，复习，甚是无聊，阅《复杂网络算法与应用》一书，得知**最小生成树问题（Minimum spanning tree）**问题。记之。 何为树：连通且不含圈的图称为树。 图T=(V,E),|V|=n,|