代码搜索：malloc
找到约 10,000 项符合「malloc」的源代码
代码结果 10,000
www.eeworm.com/read/176662/9488574
cpp multiply.cpp
#include
#include
#define MAXNODE 300
typedef struct dnode /*define a double-link*/
{
int data;
struct dnode *next;
struct dnode *prior;
}LINKNODE;
www.eeworm.com/read/372762/9494285
c euler.c
#include "stdio.h"
#include "stdlib.h"
#include
int Func(y,d)
double y[],d[];
{
d[0]=y[1]; /*y0'=y1*/
d[1]=-y[0]; /*y1'=y0*/
d[2]=-y[2]; /*y2'=y2*/
return(1);
}
void E
www.eeworm.com/read/372762/9494298
c grkt10.c
#include "stdio.h"
#include "stdlib.h"
void RKT(t,y,n,h,k,z)
int n; /*微分方程组中方程的个数，也是未知函数的个数*/
int k; /*积分的步数(包括起始点这一步)*/
double t; /*积分的起始点t0*/
double h; /*积分的步长*/
double y[]; /
www.eeworm.com/read/372762/9494333
c dynamic.c
# include
# include
# define NUM 10
int main()
{
char *str[NUM]; /* 定义一个字符性的指针数组 */
int t;
/* 为数组中的每个指针分配内存 */
for(t=0; t
www.eeworm.com/read/372449/9510107
c checker.c
#include
#include
int main()
{
char *ptr = (char *) malloc(1024);
char ch;
/* Uninitialized read */
ch = ptr[0];
/* Write beyond the block */
ptr[1024]
www.eeworm.com/read/372391/9511904
cpp algo6-1.cpp
// algo6-1.cpp 求赫夫曼编码。实现算法6.12的程序
#include"c1.h"
#include"c6-7.h"
int min(HuffmanTree t,int i)
{ // 函数void select()调用
int j,flag;
unsigned int k=UINT_MAX; // 取k为不小于可能的值
for(j=1;
www.eeworm.com/read/175933/9524501
tcl memleak3.tcl
#/bin/sh
# \
exec `which tclsh` $0 "$@"
#
# The author disclaims copyright to this source code. In place of
# a legal notice, here is a blessing:
#
# May you do good and not evil.
# May you fin
www.eeworm.com/read/175931/9525425
c xmlpullparseres.c
#include "XmlPullParserES.h"
#include
#include
#include
#define AttributeType "CDATA"
#define PROPERTY_XMLDECL_VERSION "xmldecl-version"
#define PROPERTY_XMLD
www.eeworm.com/read/371950/9529371
cpp main.cpp
/******************************************************************************
19. (背包问题) 有 N 件物品 d1，......dN，每件物品重量为 W1，..., WN
(Wi > 0)， 每件物品价值为 V1，......VN (Vi>0)。用这N件物品的某个子集
填空背包，使得所取物品的总重量
www.eeworm.com/read/371950/9529381
cpp main.cpp
/*************************************************************************************
75. (钱币系统问题) 某钱币系统由 k (k≤20) 种硬币组成, 币值依次为 a[1],
a[2],...,a[k], 其中 a[i] (i=1,2,...,k) 为互不相同的正整数, 且依降序排列,