代码搜索:malloc

找到约 10,000 项符合「malloc」的源代码

代码结果 10,000
www.eeworm.com/read/450798/7476713

c 单链表2.c

#include #include struct node{ int key; struct node *next; }; void creat_link(struct node *); main() { struct node *head=NULL; creat_li
www.eeworm.com/read/450470/7483346

c fillheap.c

#include #include void main(void) { char *buffer1, *buffer2, *buffer3; int i, state; buffer1 = malloc(100); buffer2 = malloc(200); buffer3 = malloc(300)
www.eeworm.com/read/449694/7498003

c 单链表2.c

#include #include struct node{ int key; struct node *next; }; void creat_link(struct node *); main() { struct node *head=NULL; creat_li
www.eeworm.com/read/448997/7520563

cpp algo0209.cpp

Status ListInsert_L(LinkList &L, int i, ElemType e) { // 算法2.9 // 在带头结点的单链线性表L的第i个元素之前插入元素e LinkList p,s; p = L; int j = 0; while (p && j < i-1) { // 寻找第i-1个结点 p = p->next;
www.eeworm.com/read/448642/7528801

h local.h

#include #include #include "util.h" #include "lintok.h" #if defined(LIBARRAY_NOT_INSTALLED) typedef double *doublearray1d; #define da1d_new(n) ((double *) malloc((n) * siz
www.eeworm.com/read/448642/7528803

h local.h

#include #include #include "util.h" #include "lintok.h" #if defined(LIBARRAY_NOT_INSTALLED) typedef double *doublearray1d; #define da1d_new(n) ((double *) malloc((n) * siz
www.eeworm.com/read/446574/7576585

c main.c

#include "head.h" #include "stdafx.h" int main() { /*int** P; int* D; int i,k; int*** T; trid_tree* root =(trid_tree*) malloc(sizeof(trid_tree)); MGraph* G = (MGraph* ) m
www.eeworm.com/read/446385/7580515

cpp selemonkeyking.cpp

//建立循环链表,实现选猴王的程序 #include #include #define ERROR 0 #define LEN sizeof(struct LNode) typedef struct LNode { int data; struct LNode *next; }LNode,*LinkList; struct
www.eeworm.com/read/445950/7587600

c fillheap.c

#include #include void main(void) { char *buffer1, *buffer2, *buffer3; int i, state; buffer1 = malloc(100); buffer2 = malloc(200); buffer3 = malloc(300)
www.eeworm.com/read/445230/7597769

c fillheap.c

#include #include void main(void) { char *buffer1, *buffer2, *buffer3; int i, state; buffer1 = malloc(100); buffer2 = malloc(200); buffer3 = malloc(300)