代码搜索：malloc

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

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/299792/7831755

c 12cplx.c

#include "stdlib.h" int cplx(n,m,a,b,alpha,eps,x,xx,k,s,f) int n,m,k; void (*s)(); double a[],b[],alpha,eps,x[],xx[],(*f)(); { double rn(double *); int r,g,i,j,it,kt,jt,kk;
·
www.eeworm.com/read/299792/7831993

c 10gear.c

#include "math.h" #include "stdlib.h" #include "4rinv.c" int gear(a,b,hmin,hmax,h,eps,n,y0,k,t,z,ss,f) void (*f)(),(*ss)(); int n,k; double a,b,hmin,hmax,h,eps,y0[],t[],z[];
·
www.eeworm.com/read/197861/7965538

txt 多项式乘法.txt

（多项式乘法）编写计算两个多项式相乘P(x)Q(x)=R(x)的函数： void muity(float a[],int m,float b[],int n,float c[]，int *k); 其中数组a[],b[],c[]分别存放三个多项式的系数，m,n,k分别是多项式P(x)、Q(x)、R(x)的次数，通过形参与实参的结合返回c[],k的值。 （全部排列）给定n个
·
www.eeworm.com/read/197671/7979450

c 12cplx.c

#include "stdlib.h" int cplx(n,m,a,b,alpha,eps,x,xx,k,s,f) int n,m,k; void (*s)(); double a[],b[],alpha,eps,x[],xx[],(*f)(); { double rn(double *); int r,g,i,j,it,kt,jt,kk;
·
www.eeworm.com/read/197671/7979657

c 10gear.c

#include "math.h" #include "stdlib.h" #include "4rinv.c" int gear(a,b,hmin,hmax,h,eps,n,y0,k,t,z,ss,f) void (*f)(),(*ss)(); int n,k; double a,b,hmin,hmax,h,eps,y0[],t[],z[];
·
www.eeworm.com/read/297311/8031932

c svkernel.c

/*------------------------------data_instruction------------------------------------- excute the mode as: svkernel(u,v,'P',p,Dx1,Dy1,Dx2,Dy2); u and v are kernel arguments; 'L' or 'P'
·
www.eeworm.com/read/295931/8133090

c 12cplx.c

#include "stdlib.h" int cplx(n,m,a,b,alpha,eps,x,xx,k,s,f) int n,m,k; void (*s)(); double a[],b[],alpha,eps,x[],xx[],(*f)(); { double rn(double *); int r,g,i,j,it,kt,jt,kk;
·
www.eeworm.com/read/295931/8133378

c 10gear.c

#include "math.h" #include "stdlib.h" #include "4rinv.c" int gear(a,b,hmin,hmax,h,eps,n,y0,k,t,z,ss,f) void (*f)(),(*ss)(); int n,k; double a,b,hmin,hmax,h,eps,y0[],t[],z[];
·
www.eeworm.com/read/145241/12743951

txt ch2_4.txt

void dlbcr(JD *p,int x) { JD *s; s=(JD*)malloc(sizeof(JD)); s->data=x; s->link=p->link; p->link=s; }
·
www.eeworm.com/read/245852/12777215

txt 作业排序算法.txt

完整的代码（C语言）： #include #include int FIND(int *parent,int i) {//查找含有元素i的树根，使用压缩规则去压缩由i到根j的所有结点 int j,k,t; j=i; while(parent[j]>0
·