Yurken的博客

#include<stdio.h>#include<stdlib.h>#define maxn 1005struct sqlist{ int *p; int length; int size;};sqlist create(){ sqlist l; l.p=(int*)malloc(sizeof(int)*maxn); l.size=maxn; l.length=0; return l;}int inser

#include<bits/stdc++.h>#define ok 1#define error 0#define MAXSIZE 40typedef char sstring[MAXSIZE-1];#define DestoryString clearstringtypedef int Status;using namespace std;Status StrAssign(sstring t,char *chars){ if(strlen(chars)&gt

#include <stdio.h>#include <stdlib.h>#define maxn 1005struct deque{ char *p; int front,rear; int Size,length;};deque Create(){ deque d; d.p=(char*)malloc(sizeof(char)*maxn); d.front=maxn>>1; d.rear=maxn&gt

#include<stdio.h>#define maxn 1005typedef char str[maxn+1];void insert(str &s,char *c){ int i=0; char *cc=c; for (;*cc; cc++) { i++; } s[0]=i; for(int j=1;j<=s[0];j++){ s[j]=*(c+j-1); }}void ptr

#include<stdio.h>#include<stdlib.h>typedef char elep;#define MAXSIZE 10005struct btree { btree *l,*r; elep data;};struct stack{ btree *base,*top; elep length,Size;};stack create_Stack(){ stack stack1; stack1.base

#include<stdio.h>#include<stdlib.h>struct list{ int data; list *next;};int main4(){ list *headA,*headB,*headC,*temp,*p; temp=(list*)malloc(sizeof(list)); temp->next=NULL; headA=(list*)malloc(sizeof(list)); headA->next=temp; p=

顺序查找算法练习Time Limit: 1000 MS Memory Limit: 32768 KTotal Submit: 792 (219 users) Total Accepted: 236 (210 users) Special Judge: NoDescription在一个顺序表中查找某个关键字是否存在。Input输入为多组数据，每组为两行数据，每组中第一行为建立查找的顺序表...

#include<stdio.h>#include<iostream>using namespace std;#define MAXSIZE 100#define OK 1#define ERROR 0#define OVERFLOW -2typedef struct { int data[MAXSIZE]; int length;...

#include<stdio.h>#include<stdlib.h>typedef int elep;#define maxn 1005struct sq { elep *p; elep length; elep size;};void insert(sq &l,int x) { l.p[l.length+1]=x;//插入元素 l.len...