Long_UP的博客

#include <stdio.h>#include <stdlib.h>#define MAX_NUM 100typedef struct str{ char ch[MAX_NUM+1]; int length;}*SString;SString initSString() //字符串初始化{ SString str=(SString)malloc(sizeof(struct str)); if(!str) {

#include <stdio.h>#include <stdlib.h>#define MAX_NUM 100typedef struct str{ char ch[MAX_NUM+1]; int length;}*SString;SString initSString() //字符串初始化{ SString str=(SString)malloc(sizeof(struct str)); if(!str) {

#include <stdio.h>#include <stdlib.h>#define MAXQSIZE 100 //队列最大长度typedef int QElemType;typedef struct { QElemType *base; //初始化动态分配存储空间 int front; //头指针，队列为不空，指向队列头元素 int rese; //尾指针，队列不为空，指向尾元素的下一个位置 }SqQueue;void InitQueu(SqQ

#include <stdio.h>#include <stdlib.h>typedef int QElemType;typedef struct Qnode { QElemType data; //数据域 struct Qnode *next; //队列指针域}QNode, *QueuePtr;typedef struct { QueuePtr front; //队列头指针 QueuePtr rear; //队列尾指针}LinkQueue;vo

#include <stdio.h>#include <stdlib.h>#include <math.h>#define STACK_INIT_SIZE 100 //存储空间初始分配量#define STACKINITCREMENT 10 //存储空间分配增量typedef int SElemType;typedef struct { SElemType *base; //栈底指针-空栈时为 NULL SElemType *top; //栈顶指

#include <stdio.h>#include <stdlib.h>#define STACK_INIT_SIZE 100 //存储空间初始分配量#define STACKINITCREMENT 10 //存储空间分配增量typedef int SElemType;typedef struct { SElemType *base; //栈底指针-空栈时为 NULL SElemType *top; //栈顶指针 int stacksize; //当前

#include <stdio.h>#include <stdlib.h>typedef int ElemType;typedef struct dlnode{ ElemType data; struct dlnode *prior,*next;}DLNode,*DLinkList;void CreateDLinkList(DLinkList &DL) //创建双向链表{ int i,num; DLinkList p,s; DL = (DLNode *

#include<stdio.h>#include<stdlib.h>typedef int ElemType;typedef struct lnode{ ElemType data; struct lnode *next;}LNode,*LinkList;int CreateLinkList(LinkList &L,int num) //创建循环单链表{ int i; LinkList s,p; p = L = (LNode *)malloc(si

#include<stdio.h>#include<stdlib.h>#include<malloc.h>typedef struct LNode{ int data; struct LNode *next;}LNode,*LinkList;LinkList CreateList(int n) //构建单链表 { LinkList L,p,q; int i; L=(LNode*)malloc(size

#include <stdio.h>#include <stdlib.h> //进程头文件#define LIST_INIT_SIZE 100 //预设空间容量#define LISTINCREAMENT 10 //扩展空间增量typedef int ElemType; //数据元素类型typedef struct{ ElemType *elem; //基地址 int length; //当前长度 int listsize; //当前空间容量(单位为个.

#include <stdio.h>#include <stdlib.h>#define LIST_INIT_SIZE 50typedef int ElemType;typedef struct{ ElemType *elem; int length; int listsize;}SqList;void CreateList(SqList &L) //创建顺序表{ int num,i; scanf("%d",&num); L.elem

#include <stdio.h>/*数组A={9,-2,4,-1,6,7,-3}，调整后即为：{-2,-1,-3,9,4,6,7}*/int main(){ int a[7]={9,-2,4,-1,6,7,-3}; int *p,*q; int temp; p = &a[0]; q = a + 6; printf("\n未调整的数据集合\n"); while(p <= a + 6) { printf("%4d",*p); p++; }