![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/07\/20250730011729-688972a9293e9.png\")
\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/07\/20250730011729-688972a98c1b0.png\")
<\/p>\n
\n<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/07\/20250730011730-688972aa1d4c8.png\")
\n![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/07\/20250730011730-688972aa5ff30.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/07\/20250730011730-688972aab6c0e.png\")
\n\u6ce8\u91ca：\u8fd9\u91cc\u662f\u4ee532\u4f4d\u7cfb\u7edf\u6765\u4e3e\u4f8b，\u6240\u4ee5\u6307\u9488\u5bb9\u91cf\u4f4d4\u5b57\u8282\u3002
\n\u56fe\u89e3：
\n![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/07\/20250730011731-688972ab1a0bc.png\")
<\/p>\n
\u4f8b：
\n![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/07\/20250730011731-688972ab66c8b.png\")
<\/p>\n
int main(void)
\n{
\nint i=1;
\nint *p;
\np=&i; \/\/ \u50a8\u5b58\u6307\u5b9a\u7684\u5730\u5740<\/p>\n
printf("%p\\\\n",p);
\nchar *l;
\nl=(char *)&i;
\nprintf("%d\\\\n",*l);
\nif（*I==1）
\n{
\nputs（\u201clittle\u201d）；
\n}
\nelse
\n{
\nputs（\u201cbig\u201d）；
\n}
\nreturn 0;
\n}<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/07\/20250730011731-688972abb47a1.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/07\/20250730011731-688972abd1542.png\")
\n\u8f93\u51fa：yes<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/07\/20250730011732-688972ac11953.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/07\/20250730011732-688972ac371e3.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/07\/20250730011732-688972ac80278.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/07\/20250730011732-688972ac95fd5.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/07\/20250730011732-688972aca3a58.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/07\/20250730011732-688972acb2f6c.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/07\/20250730011732-688972acbbdfc.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/07\/20250730011732-688972acce31d.png\")
\n![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/07\/20250730011732-688972acde8b0.png\")
\n![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/07\/20250730011732-688972acf29d3.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/07\/20250730011733-688972ad17665.png\")
\n![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-30yrarezmh34h.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-30x4zo41gve5o.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-3015qxywo04du.png\")
<\/p>\n
void maxOrMinOfThreeNumbers(int a,int b,int c ,int *pmax,int *pmin)
\n{
\n*pmax=a>b?a:b;
\n*pmax=c>*pmax?c:*pmax;
\n*pmin=a<b?a:b;
\n*pmin=c<*pmin?c:*pmin;
\n}<\/p>\n
int main(void)
\n{
\nint a=3,b=1,c=2;
\nint max;
\nint min;
\nmaxOrMinOfThreeNumbers(a,b,c,&max,&min);
\nprintf("%d\\\\n",max);
\nprintf("%d\\\\n",min);
\nreturn 0;
\n}<\/p>\n
#endif
\n#if 0
\nvoid swap(int *a,int *b)
\n{
\nint t=*a;
\n*a=*b;
\n*b=t;
\n}
\nint main(void)
\n{
\nint i=10,j=20;
\nswap(&i,&j);
\nprintf("%d %d\\\\n",i,j);
\nreturn 0;
\n}<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-30m12nar2jpkh.png\")
\n![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-30d1r01o0fdjn.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-305a2i0x1d5vy.png\")
\n![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-30zcgqqjz4omr.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-30lvfdntzyiql.png\")
\n![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-3022njzae2uvp.png\")
\n\u603b\u7ed3：
\n![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-300sh3hn3fnhr.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-30um4u0caoh1u.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-30vu5opw2lt3c.png\")
\n![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-30dorenngjnj5.png\")
<\/p>\n
void Puts( const char *s)
\n{
\nwhile(*s)
\n{
\nputchar(*s++);
\n}
\nputchar('\\\\n');
\n}<\/p>\n
int STRLEN( const char *s)
\n{
\nint counter=0;
\nwhile(*s)
\n{
\n++s;
\n++counter;
\n}
\nreturn counter;
\n}
\nint main(void)
\n{
\nchar s[100]="hello";
\nPuts(s);
\nprintf("%d\\\\n",STRLEN("hello"));
\nreturn 0;
\n}<\/p>\n
void Strcpy(char *dest,const char *src)
\n{
\nwhile(*src)
\n{
\n*dest++=*src++;
\n}
\n*dest=0;
\n}<\/p>\n
char *Strncpy(char *dest, const char *src,int n)
\n{
\nchar *ret=dest;
\nwhile(*src&&n–)
\n{
\n*dest++=*src++;
\n}
\nreturn ret;
\n}<\/p>\n
void Memcpy(void *dest,void *src,int n) \/\/\u4efb\u610f\u7c7b\u578b\u62f7\u8d1d
\n{
\nchar *p=(char *)dest;
\nchar *q=(char *)src;
\nwhile(n–)
\n{
\n*p++=*q++;
\n}
\n}<\/p>\n
char *Strcat(char *dest,const char *src)
\n{
\nchar *ret=dest;
\nwhile(*dest)
\n{
\ndest++;
\n}
\nwhile(*src)
\n{
\n*dest++=*src++;
\n}
\n*dest=0;
\nreturn ret;
\n}<\/p>\n
void Strncat(char *dest, const char *src,int n)
\n{
\nwhile(*dest)
\n{
\ndest++;
\n}
\nwhile(*src&&n–)
\n{
\n*dest++=*src++;
\n}
\n*dest=0;
\n}<\/p>\n
int Strcmp(const char *s1,const char *s2 )
\n{
\nwhile(*s1&&*s2&&*s1==*s2)
\n{
\n++s1;
\n++s2;
\n}
\nreturn *s1-*s2;
\n}<\/p>\n
int Strncmp(const char *s1,const char *s2,int n)
\n{
\nwhile(*s1==*s2&&*s1&&*s2&&–n)
\n{
\n++s1;
\n++s2;
\n}
\nreturn *s1-*s2;
\n}<\/p>\n
int Findchar(const char *s1,const char *s2)
\n{
\nint i;
\nfor(i=0;i<=strlen(s1)-strlen(s2);++i)
\n{
\nif(Strncmp(s1+i,s2,strlen(s2))==0)
\n{
\nbreak;
\n}
\n}
\nif(i<=strlen(s1)-strlen(s2))
\n{
\nreturn i;
\n}
\nreturn -1;
\n}<\/p>\n
int main(void)
\n{
\nchar s1[100]="hello";
\nchar s2[100];
\nchar s3[100]="world";
\nchar s4[100]="hello! World!";
\nchar s5[100]="World!";
\n\/\/int ret=Findchar(s4,s5);
\n\/\/if(ret)
\n\/\/{
\n\/\/printf("found!\u5728\u7b2c=%d\u4e2a\\\\n",ret);
\n\/\/}
\n\/\/else if(ret=-1)
\n\/\/{
\n\/\/printf("error!");
\n\/\/}
\n\/\/Strcpy(s2,s1);
\n\/\/Memcpy(s3,s1,sizeof(s1));
\n\/\/ Strcat(s3,s1);
\n\/\/printf("%d\\\\n",Strcmp(s1,s3));
\n\/\/Strncat(s1,s3+1,3);
\n\/\/ printf("%d\\\\n",Strncmp(s1,s3,3));
\nputs(Strcat(s3,s1));
\nreturn 0;
\n}<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-30zy3gxypsaiv.png\")
\n![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-30k2vnkq4bvut.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-30opano2rdssn.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-30cfghadpw2ey.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-30xuvu23bhq1e.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-30mpod1tpgkos.png\")
<\/p>\n
#include<stdio.h>
\nvoid printArray(int len,int *a)
\n{
\nint i;
\nfor(i=0;i<len;++i)
\n{
\nprintf("%d ",*a++);
\n}
\nputs("\\\\n");
\n}<\/p>\n
int sumOfArray(int len,int *a)
\n{
\nint sum=0,i;
\nfor(i=0;i<len;++i)
\n{
\nsum+=*a++;
\n}
\nreturn sum;
\n}<\/p>\n
void verseArray(int len,int *a)
\n{
\nint i;
\nfor(i=0;i<len\/2;++i)
\n{
\nint t=*(a+i);
\n*(a+i)=*(a+len-i-1);
\n*(a+len-i-1)=t;
\n}
\n}<\/p>\n
void swapArray(int *a,int *b)
\n{
\nint t=*a;
\n*a=*b;
\n*b=t;
\n}<\/p>\n
void sortArray(int *a,int len)
\n{
\nint i,j;
\nfor(i=0;i<len-1;++i)
\n{
\nfor(j=i+1;j<len;++j)
\n{
\nif(*(a+i)>*(a+j))
\n{
\nswapArray(a+i,a+j); \/\/\/\u660e\u786eswapArray\u7684\u53c2\u6570！！！！！
\n}
\n}
\n}
\n}<\/p>\n
int *binaryFind(int *a,int len,int n) \/\/!!!\u4e8c\u5206\u67e5\u627e\u4e0d\u719f\u7ec3
\n{
\nint begin=0;
\nint end=len-1;
\nwhile(begin<end)
\n{<\/p>\n
int mid=(begin+end)\/2;
\nif(*(a+mid)>n)
\n{
\nend=mid-1;
\n}
\nelse if(*(a+mid)<n)
\n{
\nbegin=mid+1;
\n}
\nelse
\n{
\nreturn a+mid;
\n}
\n}
\nreturn NULL;
\n}
\nint main(void)
\n{
\nint a[]={1,3,2,5,4,7,6,9,8,0};
\nint len=sizeof(a)\/sizeof(*a);
\n\/\/verseArray(len,a);
\n\/\/swapArray(a,&a[1]);
\n\/\/sortArray(a,len);
\nint n;
\nscanf("%d",&n);
\nint *ret=binaryFind(a,len,n);
\nif(ret)
\n{
\nprintf("found! value=%d\\\\n",*ret);
\n}
\nelse
\n{
\nprintf("error!");
\n}
\n\/\/printArray(len,a);
\n\/\/printf("%d\\\\n",sumOfArray(len,a));<\/p>\n
return 0;
\n}<\/p>\n
\u2013![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-30f24cxkn1cqx.png\")
<\/p>\n
\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014
\n![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-30ocbrtqg4gfv.png\")
<\/p>\n
![\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"](\"2025-07-30beiayhgd13j.png\")
\n\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014<\/p>\n
void printArray(int *begin,int *end)
\n{
\nwhile(begin<=end)
\n{
\nprintf("%d\\\\n",*begin++);<\/p>\n
}<\/p>\n
}<\/p>\n
void printArray2(int *begin,int *end) \/\/\u5229\u7528\u9012\u5f52
\n{
\nif(begin>end)
\n{
\nreturn ;
\n}
\nelse
\n{
\nprintf("%d\\\\n",*begin);
\nprintArray2(begin+1,end);
\n}
\n}<\/p>\n
void swapArray(int *a,int *b)
\n{
\nint t=*a;
\n*a=*b;
\n*b=t;
\n}<\/p>\n
void reverse(int *begin,int *end)
\n{
\nwhile(begin<end)
\n{
\nswapArray(begin++,end–);
\n}
\n}<\/p>\n
void reverse2(int *begin,int *end)
\n{
\nif(begin>end)
\n{
\nreturn;
\n}
\nelse
\n{
\nswapArray(begin,end);<\/p>\n
reverse2(++begin,–end);
\n}
\n}<\/p>\n
void Qsort(int *begin,int *end)
\n{
\nif(begin>=end)
\n{
\nreturn ;
\n}<\/p>\n
int *p=begin;
\nint *q=end;
\nint t=*begin;
\nwhile(p<q)
\n{
\nwhile(p<q&&*q>=t)
\n{
\n–q;
\n}
\nwhile(p<q&&*p<=t)
\n{
\n++p;
\n}
\nswapArray(p,q);
\n}
\nswapArray(begin,p);
\nQsort(begin,p-1);
\nQsort(q+1,end);
\n}<\/p>\n
void choiceSort(int *begin,int *end)
\n{
\nfor(;begin<end;++begin)
\n{
\nint *p;
\nfor(p=begin+1;p<=end;++p)
\n{
\nif(*p<*begin)
\n{
\nswapArray(begin,p);
\n}
\n}
\n}
\n}<\/p>\n
void bubbleSort(int *begin,int *end)
\n{
\nfor(;end>begin;–end)
\n{
\nfor(;begin<end;++begin)
\n{
\nint *p=begin+1;<\/p>\n
if(*p<*begin)
\n{
\nswapArray(p,begin);
\n}<\/p>\n
}
\n}
\n}<\/p>\n
int *binaryFind(int *begin,int *end,int n)
\n{
\nint *mid=(end-begin)\/2+begin;
\nif(n<*mid)
\n{
\nend=mid-1;
\n}
\nelse if(n>*mid)
\n{
\nbegin=mid+1;
\n}
\nelse
\n{
\nreturn mid;
\n}
\nreturn NULL;
\n}<\/p>\n
int main(void)
\n{
\nint a[]={2,7,5,9,3,1,4,6,10,8};
\nint len=sizeof(a)\/sizeof(*a);
\n\/\/printArray(a, a + len – 1);
\n\/\/printArray2(a,a+len-1);
\n\/\/reverse(a,a+len-1);
\n\/\/reverse2(a,a+len-1);
\nQsort(a,a+len-1);
\n\/\/choiceSort(a,a+len-1);
\nbubbleSort(a,a+len-1);
\n\/\/int *ret=binaryFind(a,a+len-1,5);
\n\/\/if(ret)
\n\/\/{
\n\/\/printf("find,value=%d\\\\n",*ret);
\n\/\/}
\n\/\/else
\n\/\/{
\n\/\/printf("error");
\n\/\/}
\n\/\/printf("%p\\\\n",binaryFind(a,a+len-1,5));
\nprintArray(a,a+len-1);
\nreturn 0;
\n}<\/p>\n
int *binaryFind2(int *begin, int *end, int n) {
\n if (begin >= end)
\n {
\n return NULL;
\n }
\n int *mid = begin + (end – begin) \/ 2
\n if (*mid == n)
\n {
\n return mid;
\n }
\n else if (*mid > n)
\n {
\n return binaryFind2(begin, mid, n);
\n }
\n else
\n {
\n return binaryFind2(mid + 1, end, n);
\n }
\n}<\/p>\n
int sumOf2DArray(int (*a)[4],int rows,int cols)
\n{
\nint i,sum=0,j;
\nfor(i=0;i<rows;++i)
\n{
\nfor(j=0;j<cols;++j)
\n{
\nsum+=*(*(a+i)+j);
\n}
\n}
\nreturn sum;
\n}<\/p>\n
void swap(int *a,int *b)
\n{
\nint t=*a;
\n*a=*b;
\n*b=t;
\n}<\/p>\n
void reverse(int *begin,int *end)
\n{
\nwhile(begin<end)
\n{
\nswap(begin++,end–);
\n}
\n}<\/p>\n
void reverse2DArray(int (*a)[4],int rows,int cols)
\n{
\nint i,j;
\nfor(i=0;i<rows;++i)
\n{
\nreverse((*(a+i)),(*(a+i)+cols-1));
\n}
\n}<\/p>\n
void print2Darray(int (*a)[4],int rows,int cols)
\n{
\nint i,j;
\nfor(i=0;i<rows;++i)
\n{
\nfor(j=0;j<cols;++j)
\n{
\nprintf("%2d ",*(*(a+i)+j));
\n}
\nputs("\\\\n");
\n}
\n}<\/p>\n
int main(void)
\n{
\nint a[][4]={1,2,3,4,5,6,7,8,9,10,11,12};
\nint rows=sizeof(a)\/sizeof(*a);
\nint cols=sizeof(*a)\/sizeof(**a);
\nreverse2DArray(a,rows,cols);
\nprint2Darray(a,rows,cols);
\n\/\/printf("%d\\\\n",sumOf2DArray(a,rows,cols));
\n}<\/p>\n
\u6587\u7ae0\u6d4f\u89c8\u9605\u8bfb241\u6b21\uff0c\u70b9\u8d5e9\u6b21\uff0c\u6536\u85cf4\u6b21\u3002\u8fd9\u7bc7\u6587\u7ae0\u4e3b\u8981\u4ecb\u7ecd\u4e86\u6307\u9488\u7684\u57fa\u7840\u6982\u5ff5\u53ca\u5e94\u7528\u3002\u6307\u9488\u662f\u4e00\u79cd\u5b58\u50a8\u5730\u5740\u7684\u6570\u636e\u7c7b\u578b\uff0c\u572832\u4f4d\u7cfb\u7edf\u53604\u5b57\u8282\uff0c64\u4f4d\u7cfb\u7edf\u53608\u5b57\u8282\u3002\u5185\u5bb9\u5305\u62ec\u6307\u9488\u7c7b\u578b\uff08\u6574\u578b\u3001\u5b57\u7b26\u578b\u3001\u6570\u7ec4\u6307\u9488\u7b49\uff09\u3001\u6307\u9488\u5b9a\u4e49\u89c4\u8303\uff08\u907f\u514d\u91ce\u6307\u9488\uff09\u3001const\u4fee\u9970\u6307\u9488\u7684\u4f5c\u7528\u3001\u6307\u9488\u4e0e\u6570\u7ec4\u7684\u5173\u7cfb\uff08\u6570\u7ec4\u6307\u9488\u4e0e\u6307\u9488\u6570\u7ec4\u7684\u533a\u522b\uff09\u3001\u6307\u9488\u8fd0\u7b97\u89c4\u5219\uff08\u5730\u5740\u504f\u79fb\u91cf\u7531\u57fa\u7c7b\u578b\u51b3\u5b9a\uff09\u3002\u91cd\u70b9\u8bb2\u89e3\u4e86\u6307\u9488\u7684\u6838\u5fc3\u7528\u9014\u2014\u2014\u5b9e\u73b0\u51fd\u6570\u95f4\u6570\u636e\u4fee\u6539\uff0c\u5e76\u901a\u8fc7\u5b9e\u4f8b\u6f14\u793a\u4e86\u6307\u9488\u5728\u53d8\u91cf\u4ea4\u6362\u3001\u6781\u503c\u67e5\u627e\u4e2d\u7684\u5e94\u7528\u3002\u6587\u7ae0\u8fd8\u8be6\u7ec6\u5206\u6790\u4e86\u4e8c\u7ef4\u6570\u7ec4\u7684\u6307\u9488\u8868\u793a\u65b9\u6cd5\uff0c\u4ee5\u53ca\u5b57\u7b26\u6307\u9488\u7684\u7279\u70b9\u548c\u6ce8\u610f\u4e8b\u9879\u3002\u6700\u540e\u5f3a\u8c03\u4e86\u6307\u9488\u6bd4\u8f83\u5e94\u5224\u65ad\u5730\u5740\u503c\u662f\u5426\u76f8\u540c\u3002<\/p>\n","protected":false},"author":2,"featured_media":47758,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[174,190],"topic":[],"class_list":["post-47778","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-server","tag-c","tag-190"],"yoast_head":"\n