代码搜索：pointer
找到约 10,000 项符合「pointer」的源代码
代码结果 10,000
www.eeworm.com/read/105701/15661185
bmp pointer.bmp
www.eeworm.com/read/100290/15877798
java pointer.java
/** By Kristi Thompson and Sean McLaughlin
*
* April 10 & 11, 1997
*
* CISC 235 - Information Structures (Winter 1997) taught by David Alex Lamb
*
* Dept of Computer Science
*
www.eeworm.com/read/430236/8760352
c pointer6.c
#include
void hello_num(int num)
{
int i;
for(i = 0; i < num; i++)
printf("hello world, num is %d\n",i);
}
void hello(void)
{
printf("hello world, no num\n");
}
void ma
www.eeworm.com/read/430236/8760353
c pointer3.c
#include
/*交换函数，其形参为指针*/
void swap(int *p1, int *p2)
{
int temp;
/*交换指针单元所指的值*/
temp = *p1;
*p1 = *p2;
*p2 = temp;
}
int main()
{
int a,b;
int *p1, *p2;
a = 10; b =
www.eeworm.com/read/430236/8760354
c pointer7.c
#include
void main(int argc, char *argv[])
{
int i = 0;
while(argc > 1)
{
/*指针数组的下标引用*/
argv[++i];
/*输出指针数组的第i个元素所指向的内容*/
printf("%s\n", argv[i]);
/*计数器减一*/
--argc;
www.eeworm.com/read/430236/8760355
c pointer2.c
#include
int main()
{
int *p1, *p2, a, b;
a = 1; b = 20;
/*给p1，p2动态分配内存*/
if((p1 = (int *)malloc(sizeof(int))) == NULL)
{
perror(malloc);
return;
}
if((p2 = (int *)ma
www.eeworm.com/read/430236/8760356
c pointer5.c
#include
#include
/*定义该函数时不需要定义其中数组的维数*/
void copy(int a[], int b[])
{
int i;
for(i = 0; i < 10; i++)
/*在编译器中是采用*(b+i) = *(a+i)的方式来处理的*/
b[i] = a[i];
}
int main
www.eeworm.com/read/430236/8760358
c pointer4.c
#include
int main()
{
int a[10], *b;
int i;
/*给b分配内存空间*/
if((b = (int *)malloc(10 * sizeof(int))) == NULL)
{
perror("malloc");
return -1;
}
memset(b, 0, 10);
/*直接将
www.eeworm.com/read/430236/8760359
c pointer1.c
#include
int main()
{
int *p1, *p2, a, b;
a = 1; b = 20;
/*将a和b的地址赋给p1和p2*/
p1 = &a;
p2 = &b;
/*从打印的结果可以看出，这时a和b的地址与p1、p2相同，
a和b的内容也与p1、p2所指向的内容相同，它们实际是同一块内存单元*/
printf("