代码搜索:alloc

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

代码结果 10,000
www.eeworm.com/read/103951/15715871

cpp tsp.cpp

#include #include #include #include #include #include #include #include #include #define maxpop 200
www.eeworm.com/read/103898/15716578

c xdel.c

#include #include #include #include #include #include #include #include main(int argc,char *argv[]) { char pr
www.eeworm.com/read/103430/15732695

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/103374/15735826

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/103337/15736498

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/103039/15747613

c xdel.c

#include #include #include #include #include #include #include #include main(int argc,char *argv[]) { char pr
www.eeworm.com/read/102731/15760582

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/102121/15792932

cpp linkcyc.cpp

// 用尾指针表示的循环链表--实现队列 #include #include #include #include typedef struct node{ char c; struct node *next; }node,*link; void creatq(link &q){
www.eeworm.com/read/102118/15792938

cpp linkcyc.cpp

// 用尾指针表示的循环链表--实现队列 #include #include #include #include typedef struct node{ char c; struct node *next; }node,*link; void creatq(link &q){
www.eeworm.com/read/101771/15818807

c fillheap.c

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