日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

當(dāng)前位置: 首頁 > 人文社科 > 生活经验 >内容正文

生活经验

结构与函数、数组

發(fā)布時(shí)間:2023/11/27 生活经验 31 豆豆
生活随笔 收集整理的這篇文章主要介紹了 结构与函数、数组 小編覺得挺不錯(cuò)的,現(xiàn)在分享給大家,幫大家做個(gè)參考.

1,結(jié)構(gòu)作為函數(shù)參數(shù)

例子(以int函數(shù)為主): int?函數(shù)名 (struct date d)

  • 整個(gè)結(jié)構(gòu)可以作為參數(shù)的值傳入函數(shù)
  • 新建一個(gè)結(jié)構(gòu)變量,并復(fù)制調(diào)用者的結(jié)構(gòu)的值

2,輸入\出結(jié)構(gòu)

(1)輸入結(jié)構(gòu)? 方法一

在這個(gè)傳入函數(shù)中,創(chuàng)建一個(gè)臨時(shí)的結(jié)構(gòu)變量,然后把這個(gè)結(jié)構(gòu)返回調(diào)用者

#include <stdio.h>
struct number{int x;int y;int z;
};
struct number getStructure(void);
int main(){struct number a;a=getStructure();printf("x = %d\n",a.x);printf("y = %d\n",a.y);printf("z = %d\n",a.z);return 0;
}
struct number getStructure(void){struct number p;scanf("%d",&p.x);   12scanf("%d",&p.y);   13scanf("%d",&p.z);   14return p;
}輸出:
x = 12
y = 13
z = 14

(2)輸入結(jié)構(gòu)?結(jié)構(gòu)指針作為參數(shù)? ?//返回結(jié)構(gòu)指針

(*p).month=12;

p->month=12;

用->表示指針?biāo)傅慕Y(jié)構(gòu)變量中的成員

#include <stdio.h>
struct number{int x;int y;int z;
};
struct number* getStructure(struct number* p);
int main(){struct number a;getStructure(&a);printf("x = %d\n",a.x);printf("y = %d\n",a.y);printf("z = %d\n",a.z);return 0;
}
struct number* getStructure(struct number* p){scanf("%d",&p->x);  12scanf("%d",&p->y);  13scanf("%d",&p->z);  14return p;
}輸出:
x = 12
y = 13
z = 14

3,結(jié)構(gòu)數(shù)組

struct?結(jié)構(gòu)名?數(shù)組名[數(shù)組大小];

#include <stdio.h>
struct number{int x;int y;int z;
};
struct number* getStructure(struct number* p);
int main(){int i;struct number a[]={ //初始化數(shù)組{2021,7,21}, //初始化結(jié)構(gòu)a[0]{2021,8,29},};for(i=0;i<2;i++){printf("x = %d ",a[i].x);printf("y = %d ",a[i].y);printf("z = %d\n",a[i].z);}return 0;
}輸出:
x = 2021 y = 7 z = 21
x = 2021 y = 8 z = 29

?4,嵌套結(jié)構(gòu)

必須先定義成員結(jié)構(gòu)的類型,再定義主結(jié)構(gòu)的類型

#include <stdio.h>
struct number{int x;int y;
};
struct num{struct number r1;
};
struct number* getStructure(struct number* p);
int main(){int i;struct num* b;struct num a={{11,22}};printf("a.r1.x = %d ",a.r1.x);  //第一種取值方式printf("a.r2.y = %d\n ",a.r1.y);printf("b->r1.x = %d 	",&b->r1.x); //第二種取值方式printf("b->r1.y = %d\n",&b->r1.y);return 0;
}

?b->r1->y? (X)

?5,結(jié)構(gòu)中的結(jié)構(gòu)的數(shù)組

struct num{struct number r1;struct number r2;
};
int main(){int i;struct num* b;struct num a[]={  {{11,22},{33,44}},  //初始化主結(jié)構(gòu)a[0]};printf("a[0].r1.x = %d   ",a[0].r1.x);printf("a[0].r1.y = %d\n ",a[0].r1.y);printf("\n");printf("a[1].r2.x = %d   ",a[0].r2.x);printf("a[1].r2.y = %d\n ",a[0].r2.y);return 0;
}輸出:
a[0].r1.x = 11   a[0].r1.y = 22a[0].r2.x = 33   a[0].r2.y = 44

  1. 不同的成員變量組合,結(jié)構(gòu)的sizeof如何,是否正好等于全部成員的sizeof之和?

  2. 結(jié)構(gòu)內(nèi)的成員之間是否連續(xù),相鄰的成員的地址的差是否等于對(duì)應(yīng)的成員的sizeof?

#include<stdio.h>struct date{int month;double day;char year;}today;int main(void)
{struct date today;today.month = 0;today.day = 5;today.year = '1';printf("sizeof(today) = %d\n",sizeof(today));printf("sizeof(today.month+today.day+today.year) = %d\n"
,sizeof(today.month)+sizeof(today.day)+sizeof(today.year));printf("address of today = %p\n",&today);printf("address of month = %p\n",&today.month);printf("address of day = %p\n",&today.day);printf("address of year = %p\n",&today.year);printf("year - day = %lf\n",today.year-today.day);printf("day - month = %lf\n",today.day-today.month);return 0;
}輸出:
sizeof(today) = 24
sizeof(today.month+today.day+today.year) = 13
address of today = 000000000062FE00
address of month = 000000000062FE00
address of day = 000000000062FE08
address of year = 000000000062FE10
year - day = 44.000000
day - month = 5.000000

結(jié)構(gòu)的sizeof是指結(jié)構(gòu)整體所占空間的大小,由于結(jié)構(gòu)中成員的排列順序,數(shù)據(jù)是否對(duì)齊,造成與各個(gè)成員的sizeof之和并不相同。

結(jié)構(gòu)內(nèi)的成員之間不一定連續(xù),相鄰的成員的地址的差不一定等于對(duì)應(yīng)的成員的sizeof,取決于成員所占空間大小與成員如何排列。

總結(jié)

以上是生活随笔為你收集整理的结构与函数、数组的全部?jī)?nèi)容,希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò),歡迎將生活随笔推薦給好友。