\u52a8\u6001\u5185\u5b58\u9700\u8981\u624b\u52a8\u7533\u8bf7，\u624b\u52a8\u5f52\u8fd8，\u5176\u5185\u5b58\u662f\u5f00\u8f9f\u5728\u5806\u533a\u3002<\/p>\n
\u7533\u8bf7\u7684\u51fd\u6570\u4e3a：<\/p>\n
void *malloc(size_t\u00a0 size) （\u9700\u5305\u542b\u5934\u6587\u4ef6#include<stdlib.h>）<\/p>\n
size：\u8981\u5206\u914d\u7684\u5185\u5b58\u5927\u5c0f，\u4ee5\u5b57\u8282\u4e3a\u5355\u4f4d\u3002\u7533\u8bf7\u7684\u7a7a\u95f4\u662f\u8fde\u7eed\u7684，\u6210\u529f\u65f6\u8fd4\u56de\u6307\u5411\u5185\u5b58\u5206\u914d\u7684\u6307\u9488（\u7c7b\u578b\u4e3avoid * \u578b，\u901a\u5e38\u9700\u8981\u8fdb\u884c\u5f3a\u5236\u7c7b\u578b\u8f6c\u6362），\u5931\u8d25\u65f6\u8fd4\u56de\u7a7a\u6307\u9488（NULL）\u3002\u9700\u624b\u52a8\u7ba1\u7406\u5185\u5b58，\u6240\u5206\u914d\u7684\u5185\u5b58\u4e0d\u4f1a\u81ea\u52a8\u91ca\u653e，\u5fc5\u987b\u8c03\u7528free（）\u907f\u514d\u5185\u5b58\u6cc4\u6f0f\u3002\u8fd4\u56de\u7684\u6307\u9488\u4f1a\u9002\u5f53\u5bf9\u9f50，\u9002\u5408\u4efb\u4f55\u6570\u636e\u7c7b\u578b\u3002\u5982：\u5206\u914d\u4e00\u4e2a\u6574\u578b\u6570\u7ec4<\/p>\n
#include<stdio.h>
\n#include<stdlib.h><\/p>\n
int main(void)
\n{
\n int n = 5;
\n int *a = (int *)malloc(n * sizeof(int));
\n if(a == NULL)
\n {
\n printf("\u5206\u914d\u5185\u5b58\u5931\u8d25\\\\n");
\n return 1;
\n }
\n int i = 0;
\n for(i = 0; i < n; ++i)
\n {
\n a[i] = i + 1;
\n }
\n for(i = 0; i < n; ++i)
\n {
\n printf("%d\\\\n",a[i])
\n }
\n free(a);
\n a = NULL;
\n return 0;
\n}<\/p>\n
\u91ca\u653e\u5185\u5b58\u540e\u672a\u5c06\u6307\u9488\u7f6e\u4e3aNULL\u79f0\u4e3a\u60ac\u7a7a\u6307\u9488，\u53ef\u80fd\u5bfc\u81f4\u975e\u6cd5\u8bbf\u95ee\u3002<\/p>\n
\u5f62\u5f0f：void *relloc（void *p，size_t\u00a0 newsize);<\/p>\n
\u53c2\u6570p：\u6307\u5411\u4e4b\u524d\u5206\u914d\u7684\u5185\u5b58\u7684\u6307\u9488<\/p>\n
\u53c2\u6570size：\u6240\u9700\u8981\u65b0\u7684\u5185\u5b58\u5927\u5c0f<\/p>\n
\u8fd4\u56de\u503c\u6307\u5411\u65b0\u7684\u5185\u5b58，\u4e0e\u539f\u6765\u7684p\u6307\u5411\u7684\u5185\u5b58\u53ef\u80fd\u4e0d\u540c\u3002<\/p>\n
\u7279\u70b9：\u6570\u636e\u4fdd\u7559，\u62f7\u8d1d\u539f\u6765\u7684\u5185\u5bb9\u5230\u65b0\u7684\u7a7a\u95f4\u3002<\/p>\n
eg：\u5982\u539f\u6765\u7533\u8bf7\u5185\u5b58\u53ea\u80fd\u5bb9\u7eb3\u957f\u5ea6\u4e3a10\u7684\u4e00\u7ef4\u6574\u578b\u6570\u7ec4，\u73b0\u5728\u6539\u4e3a\u53ef\u5bb9\u7eb3\u957f\u5ea6\u4e3a20\u7684\u4e00\u7ef4\u6574\u5f62\u6570\u7ec4\u3002<\/p>\n
void printArray(int *a,int len)
\n{
\n int i;
\n for(i < 0 ;i < len;++i)
\n {
\n printf("%2d ",*(a + i));
\n }
\n puts("");
\n}<\/p>\n
int main(void)
\n{
\n int n = 10;
\n int *p = malloc(n * sizeof(int));
\n int i;
\n for( i = 0;i < n;++i)
\n {
\n *(p + i) = i + 1;
\n }
\n int m = 20;
\n int *q = realloc(p, m * sizeof(int));
\n p = q;
\n for(i = 10;i < m; ++i)
\n {
\n *(p + i) = i + 1;
\n }
\n free(p);
\n p = q = NULL;
\n printArray(p,m);
\n return 0;
\n}<\/p>\n
\u5b83\u5b58\u50a8\u7684\u662f\u51fd\u6570\u7684\u5730\u5740，\u800c\u4e0d\u662f\u6570\u636e\u53d8\u91cf\u7684\u5730\u5740\u3002\u901a\u8fc7\u51fd\u6570\u6307\u9488，\u53ef\u4ee5\u52a8\u6001\u7684\u8c03\u7528\u4e0d\u540c\u7684\u51fd\u6570，\u5b9e\u73b0\u56de\u8c03\u3002<\/p>\n
\u57fa\u672c\u8bed\u6cd5：<\/p>\n
\u5b9a\u4e49\u51fd\u6570<\/p>\n
int add（int a,int b）
\n{
\n return a + b
\n}<\/p>\n
int sub(int a,int b)
\n{
\n return a – b;
\n}<\/p>\n
1\u3001\u5b9a\u4e49\u51fd\u6570\u6307\u9488：\u00a0 \u8fd4\u56de\u503c\u7c7b\u578b（*\u6307\u9488\u53d8\u91cf\u540d）（\u53c2\u6570\u5217\u8868）<\/p>\n
\u5982\u56de\u8c03\u4e0a\u8ff0\u4ee3\u7801：int (*pfn)(int , int);<\/p>\n
2\u3001\u521d\u59cb\u5316\u6307\u9488<\/p>\n
pfn = &add;
\n\u6216
\npfn = add;<\/p>\n
(\u51fd\u6570\u540d\u672c\u8eab\u4ee3\u8868\u51fd\u6570\u7684\u5165\u53e3\u5730\u5740)<\/p>\n
\u5373：<\/p>\n
int add（int a,int b）
\n{
\n return a + b
\n}<\/p>\n
int sub(int a,int b)
\n{
\n return a – b;
\n}<\/p>\n
int(*pfn)(int,int) = add;<\/p>\n
\u6307\u9488\u4fbf\u6307\u5411\u4e86add\u51fd\u6570（\u6539\u4e3asub，\u4fbf\u6307\u5411sub）<\/p>\n
3\u3001\u901a\u8fc7\u51fd\u6570\u6307\u9488\u8c03\u7528\u51fd\u6570<\/p>\n
int div3(int n)
\n{
\n return n % 3 == 0;
\n}<\/p>\n
int div5(int n)
\n{
\n return n % 5 == 0;
\n}<\/p>\n
int fn(int n)
\n{
\n return 1;
\n}<\/p>\n
void printArray(int *a,int len,int(*pfn)(int))
\n{
\n int i;
\n for(i = 0;i < len; ++i)
\n {
\n if(pfn(*(a + i)))
\n {
\n printf("%2d ",*(a + i));
\n }
\n }
\n puts("");<\/p>\n
}<\/p>\n
\u4e3b\u51fd\u6570\u8c03\u7528printArray\u4f20\u53c2，\u6700\u540e\u4e00\u4e2a\u4f20\u5165\u56de\u8c03\u51fd\u6570\u7684\u51fd\u6570\u540d\u3002<\/p>\n
\u6307\u9488\u6570\u7ec4\u662f\u6307\u4e00\u4e2a\u6570\u7ec4，\u5176\u5143\u7d20\u90fd\u662f\u6307\u9488，\u7b80\u5355\u5730\u8bf4，\u6570\u7ec4\u4e2d\u7684\u6bcf\u4e00\u4e2a\u5143\u7d20\u5b58\u50a8\u90fd\u662f\u4e00\u4e2a\u5185\u5b58\u5730\u5740，\u800c\u4e0d\u662f\u76f4\u63a5\u5b58\u50a8\u6570\u636e\u3002<\/p>\n
\u5f53\u5b83\u4f5c\u4e3a\u51fd\u6570\u53c2\u6570，\u5f62\u53c2\u662f\u6307\u5411\u6307\u9488\u7684\u6307\u9488\u3002<\/p>\n
void printStrings(char **p,int len)
\n{
\n int i;
\n for(i = 0;i < len;++i)
\n {
\n puts(p[i]);
\n }
\n}<\/p>\n
void reverseStrings(char **p,int len)
\n{
\n int i;
\n for(i = 0;i < len \/ 2;++i)
\n {
\n char *t;
\n t = p[i];
\n p[i] = p[len – i – 1];
\n p[len – i – 1] = t;
\n }
\n}<\/p>\n
char *maxStrings(char **p,int len)
\n{
\n char *max = p[0];
\n int i;
\n for(i = 1;i < len; ++i)
\n {
\n if(strcmp(max,p[i]) < 0)
\n {
\n max = p[i];
\n }
\n }
\n return max;
\n}<\/p>\n
void sortStrings(char **p,int len)
\n{
\n int i,j;
\n for(i = 0; i < len – 1;++i)
\n {
\n for(j = i + 1;j < len; ++j)
\n {
\n if(strcmp(p[i] , p[j]) > 0)
\n {
\n char *t;
\n t = p[i];
\n p[i] = p[j];
\n p[j] = t;
\n }
\n }
\n }
\n}<\/p>\n
int main(void)
\n{
\n char *s[3] = {"Hello","World!","China"};
\n int len = sizeof(s) \/ sizeof(*s);
\n \/\/reverseStrings(s,len);
\n \/\/printStrings(s,len);
\n \/\/printf("%s\\\\n",maxStrings(s,len));
\n sortStrings(s,len);
\n printStrings(s,len);
\n return 0;
\n}<\/p>\n","protected":false},"excerpt":{"rendered":"
\u6587\u7ae0\u6d4f\u89c8\u9605\u8bfb74\u6b21\u3002\u7533\u8bf7\u7684\u7a7a\u95f4\u662f\u8fde\u7eed\u7684\uff0c\u6210\u529f\u65f6\u8fd4\u56de\u6307\u5411\u5185\u5b58\u5206\u914d\u7684\u6307\u9488\uff08\u7c7b\u578b\u4e3avoid * \u578b\uff0c\u901a\u5e38\u9700\u8981\u8fdb\u884c\u5f3a\u5236\u7c7b\u578b\u8f6c\u6362\uff09\uff0c\u5931\u8d25\u65f6\u8fd4\u56de\u7a7a\u6307\u9488\uff08NULL\uff09\u3002\u9700\u624b\u52a8\u7ba1\u7406\u5185\u5b58\uff0c\u6240\u5206\u914d\u7684\u5185\u5b58\u4e0d\u4f1a\u81ea\u52a8\u91ca\u653e\uff0c\u5fc5\u987b\u8c03\u7528free\uff08\uff09\u907f\u514d\u5185\u5b58\u6cc4\u6f0f\u3002\u6307\u9488\u6570\u7ec4\u662f\u6307\u4e00\u4e2a\u6570\u7ec4\uff0c\u5176\u5143\u7d20\u90fd\u662f\u6307\u9488\uff0c\u7b80\u5355\u5730\u8bf4\uff0c\u6570\u7ec4\u4e2d\u7684\u6bcf\u4e00\u4e2a\u5143\u7d20\u5b58\u50a8\u90fd\u662f\u4e00\u4e2a\u5185\u5b58\u5730\u5740\uff0c\u800c\u4e0d\u662f\u76f4\u63a5\u5b58\u50a8\u6570\u636e\u3002eg\uff1a\u5982\u539f\u6765\u7533\u8bf7\u5185\u5b58\u53ea\u80fd\u5bb9\u7eb3\u957f\u5ea6\u4e3a10\u7684\u4e00\u7ef4\u6574\u578b\u6570\u7ec4\uff0c\u73b0\u5728\u6539\u4e3a\u53ef\u5bb9\u7eb3\u957f\u5ea6\u4e3a20\u7684\u4e00\u7ef4\u6574\u5f62\u6570\u7ec4\u3002\u5b83\u5b58\u50a8\u7684\u662f\u51fd\u6570\u7684\u5730\u5740\uff0c\u800c\u4e0d\u662f\u6570\u636e\u53d8\u91cf\u7684\u5730\u5740\u3002\u8fd4\u56de\u503c\u6307\u5411\u65b0\u7684\u5185\u5b58\uff0c\u4e0e\u539f\u6765\u7684p\u6307\u5411\u7684\u5185\u5b58\u53ef\u80fd\u4e0d\u540c\u3002<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[174,190],"topic":[],"class_list":["post-50050","post","type-post","status-publish","format-standard","hentry","category-server","tag-c","tag-190"],"yoast_head":"\n