/tags/c/ Recent content in C on 赵裕的博客 Hugo -- gohugo.io zh-cn Thu, 30 Jul 2026 15:32:42 +0800 /articles/da-duan-big-endian-yu-xiao-duan-little-endian/ Thu, 27 Apr 2017 00:00:00 +0000 /articles/da-duan-big-endian-yu-xiao-duan-little-endian/ 大端（Big Endian）与小端（Little Endian） 本文记录了计算机中存在的两种数据存储模式及其对网络编程的影响。 内存抽象 在较高层次上，可以把内存抽象成一个很大的数组。唯一不同的是，一个元素( /articles/cyu-yan-shi-xian-ipv6zhua-bao-cheng-xu/ Wed, 19 Apr 2017 00:00:00 +0000 /articles/cyu-yan-shi-xian-ipv6zhua-bao-cheng-xu/ C语言实现IPv6抓包程序 本文记录了如何借助libpcap实现一个简单的抓包程序。 准备 对于实现一个抓包程序，最重要的是熟悉每种协议。熟悉协议包括两部分：每个协议具体字段的意义和每个协议在C语言中对应的 /articles/cyu-yan-zhong-bu-dai-de-dai-ma-kuai/ Thu, 16 Mar 2017 00:00:00 +0000 /articles/cyu-yan-zhong-bu-dai-de-dai-ma-kuai/ ‘C语言中不带{}的代码块’ 本文讨论了C99中的一个新特性：不带{}的代码块。以及阅读编程语言教程的一种新思路。 问题 在阅读C Primer Plus325页时遇到以下一句话： 先前曾提到C99 /articles/cyu-yan-hong-zhan-kai-de-shun-xu-wen-ti/ Tue, 14 Mar 2017 00:00:00 +0000 /articles/cyu-yan-hong-zhan-kai-de-shun-xu-wen-ti/ C语言宏展开的顺序问题 本文记录了作者遇到的一个关于C语言宏展开顺序的问题及其解释。 问题 这是我在阅读The C Puzzle Book一书中遇到的一个问题，为了简化问题，我写了以下一段代码 #include <stdio.h> #define TEST(x) x*5 #define PR(x) printf(#x " = %d", x) #define PRINT1(x) PR(x);printf("\n") /articles/2016-linux-problem-handling-stdio-h-no-such-file-or-directory-linux/ Sat, 03 Dec 2016 00:00:00 +0000 /articles/2016-linux-problem-handling-stdio-h-no-such-file-or-directory-linux/ 本来打算编译一下《自制编程语言》一书的代码，结果提示错误： 其实说的还是很清楚的，一般出现这种情况都是没有安装相应的库，所以： 再次编译，成功： 测试代码： # comment print("hoge\tpiyo\n\\zn"); print("abc\n"); print("3 + 5.." + (3 + 5) + "\n"); print("3 - 5.." + (3 - 5) + "\n"); print("3 + -5.." /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-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-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-c-language-to-implement-penna-model/ Fri, 03 Jun 2016 00:00:00 +0000 /articles/2016-c-language-to-implement-penna-model/ 一年前写的代码，偶然翻出来。发现自己当时水平还不赖吗。 1 # include <stdio.h> 2 # include <stdlib.h> 3 # include <time.h> 4 # include <stdbool.h> 5 # include <windows.h> 6 7 # define N0 1000 //初始时刻种群数量为1000 8 # define Nmax 100000 //种群最大数量为100000 9 # define R 6 //最低繁殖年 /articles/2016-c-language-uses-object-oriented-thinking-to-write-greedy-snake/ Fri, 29 Apr 2016 00:00:00 +0000 /articles/2016-c-language-uses-object-oriented-thinking-to-write-greedy-snake/ 大概一年前这时候，接触C语言一个月，那时候知之甚少，对面向对象只觉”可远观而不可亵玩“，而且会看到很多言论说C语言就是面向过程的语言，C++就是面向对象的语言。不过，不记得什么时候在网上看到过一篇博文 /articles/2016-learn-more-about-the-memset-function/ Fri, 15 Apr 2016 00:00:00 +0000 /articles/2016-learn-more-about-the-memset-function/ 最近，和同学讨论了一下memset函数，趁着周五空闲做一总结。 memset函数最常用的功能就是初始化数组了（主要是置零），如 #include <iostream> #include <cstring> using namespace std; int main(int argc, char const *argv[]) { int A[10]; memset(A, 0, sizeof(A)); cout << A[0] << '\t' << A[1] << endl; return 0; } 输出 0 0 但是， /articles/2016-c-language-to-implement-snake-source-code/ Sun, 20 Mar 2016 00:00:00 +0000 /articles/2016-c-language-to-implement-snake-source-code/ 先放效果 源代码 //2016-2-12 //zhaoyu //Gmail:zhaoyu1995.com@gmail.com //Language: C //Platform:Code::Blocks #include <stdio.h> #include <windows.h> #include <stdlib.h> #include <time.h> typedef struct snake { int x; int y; struct snake *next; }Snake; int X, Y; enum STATUS{Up = 1, Down, Left, Right}; Snake *pHead, *pBody;//the head of the snake enum STATUS Direction; int score=0, scorePerFood=10; int gameStatus = 0; int timeInterval = 200; void gameEnd(void); void setPosition(int x, int y) { COORD pos; HANDLE hOutput; pos.X = x; pos.Y = y; hOutput = GetStdHandle(STD_OUTPUT_HANDLE); SetConsoleCursorPosition(hOutput, pos); } void hideCursor() { CONSOLE_CURSOR_INFO cursor_info = { 1, 0 }; SetConsoleCursorInfo(GetStdHandle(STD_OUTPUT_HANDLE), &cursor_info);