随笔分类 -  Data Structure

摘要：1. 一个单向链表倒置,最简单高效的方法(算法)2. LoadLibrary 与 LoadLibraryEx 的区别(WINDOWS)3. 进程与线程的区别(理论)4.如果碰到一个非必现的崩溃,你该怎么办?(解决问题的方法)我们这客户端面试的原题. 阅读全文

摘要：1 #include 2 #include 3 #include 4 5 #define STACK_INIT_SIZE 20 6 #define STACKINCREMENT 10 7 8 typedef char ElemType; 9 typedef struct 10 {11 ElemType *base;12 ElemType *top;13 int stackSize;14 }sqStack;15 16 void InitStack(sqStack *s)17 {18 s->base = (ElemType*)malloc(STACK_I... 阅读全文

摘要：#include#include#define CardNum 13typedef struct Node{ int data; struct Node *next;}Node;void CreateList(Node **list ,int n = CardNum){ Node *head = (Node*)malloc(sizeof(Node)); head->next = NULL; Node* p =head; Node* s ; while( n--) { s = (Node*)malloc(sizeof(Node)); ... 阅读全文

摘要：1 #include 2 #include 3 4 #define Error 0 5 #define OK 1 6 typedef int ElemType; 7 typedef int status; 8 9 typedef struct Node10 {11 ElemType data;12 struct Node *next;13 }Node;14 15 //创建约瑟夫环16 17 status Create(Node** node ,int n)18 {19 Node* head = (Node*)malloc(sizeof(Node));20 ... 阅读全文