{"id":556,"date":"2025-03-23T17:13:44","date_gmt":"2025-03-23T09:13:44","guid":{"rendered":"\/?p=556"},"modified":"2025-06-29T16:08:45","modified_gmt":"2025-06-29T08:08:45","slug":"%e6%8c%87%e9%92%88","status":"publish","type":"post","link":"\/?p=556","title":{"rendered":"\u6307\u9488-\u6570\u636e\u7ed3\u6784"},"content":{"rendered":"\n
\"\"<\/div><\/figure>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n

&\u53d6\u5730\u5740 \u3001\uff08char*,short*,int*,long*\uff09\u4e3a\u6570\u636e\u7c7b\u578b\u6307\u9488\u3001(*p,*a,…)\u4e3a\u89e3\u5f15\u7528\u6307\u9488-\u4f8b\u5982\uff1a*p p\u4e3a\u6307\u9488\u7c7b\u578b\u53d8\u91cf,*p\u6307\u8bfb\u53d6\u5b58\u5728\u6307\u9488\u7c7b\u578b\u53d8\u91cf\u91cc\u7684\u5730\u5740\uff0c\u90a3\u4e2a\u5730\u5740\u91cc\u7684\u503c\u3002<\/p>\n\n\n\n

\"\"<\/div><\/figure>\n\n\n\n

1bit=0xff=255<\/p>\n\n\n\n

4\u4e2a\u4e8c\u8fdb\u5236=16\u4f4d<\/p>\n\n\n\n

8\u4e2a\u4e8c\u8fdb\u5236 = 32\u4f4d<\/p>\n\n\n\n

16\u4e2a\u4e8c\u8fdb\u5236=64\u4f4d<\/p>\n\n\n\n

\"\"<\/div><\/figure>\n\n\n\n

\u7ed3\u6784\u4f53\u6307\u9488\u7528->\u6307\u5411\u6210\u5458\u53d8\u91cf=\uff08*\u7ed3\u6784\u4f53\u6307\u9488\u7528\uff09.\u6307\u5411\u6210\u5458\u53d8\u91cf<\/p>\n\n\n\n

\u7ed3\u6784\u4f53\u53d8\u91cf\u7528. \u6307\u5411\u6210\u5458\u53d8\u91cf<\/p>\n\n\n\n

\"\"<\/div><\/figure>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n

\u4e00\u4e2a\u6307\u9488\u6570\u7ec4\u5b58\u653e\u4e86\u6bcf\u4e00\u4e2a\u6570\u7ec4\u7684\u9996\u5730\u5740<\/p>\n\n\n\n

\"\"<\/div><\/figure>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n

\u51fd\u6570\u7c7b\u578b\u6307\u9488 void (*p)(\u53c2\u6570);<\/p>\n\n\n\n

(void (*)())0\u5f3a\u5236\u7c7b\u578b\u8f6c\u6362\u5c060\u8f6c\u6210\u51fd\u6570\u7c7b\u578b<\/p>\n\n\n\n

(*void(*)()0)()\u57280\u5904\u7684\u51fd\u6570\u7c7b\u578b\u6307\u9488<\/p>\n\n\n\n

\"\"<\/div><\/figure>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n

\u94fe\u8868<\/h2>\n\n\n\n

\u5934\u63d2\u5165\u5f0f<\/h3>\n\n\n\n
#include <stdio.h>\n#include <stdlib.h>\n\n#define MaxArry 100\n\ntypedef int EM;\n\n\n\/\/\u521b\u5efa\u7ed3\u6784\u4f53\ntypedef struct temp{\n\ttemp* last;\n\tEM* data;\n\ttemp* next;\n\tint lenght;\n}Temp;\n\n\n\/\/\u521d\u59cb\u5316\u7ed3\u6784\u4f53\nTemp* InitArry() {\n\tTemp* L = (Temp*)malloc(sizeof(Temp));\t\n\tL->data = (EM*)malloc(sizeof(EM)*MaxArry+1);\n\tL->last = NULL;\n\tL->next = NULL;\n\tL->lenght = 0;\n\treturn L;\n}\n\n\/\/\u5934\u63d2\u5165\u5f0f\u94fe\u8868\nvoid InsertChain(Temp* p,EM data) {\n\tTemp* L = (Temp*)malloc(sizeof(Temp));\n\tL->data = (EM*)malloc(sizeof(EM) * MaxArry + 1);\n\tL->data[0] = data;\n\tL->last = p;\n\tL->next = p->next;\n\tp->next = L;\n}\n\n\/\/\u904d\u5386\u94fe\u8868\nint ListArry(Temp* p) {\n\tTemp* nxt = p->next;\n\twhile (nxt != NULL) {\n\t\tprintf(\"%d\\r\\n\", nxt->data[0]);\n\t\tnxt = nxt->next;\n\t}\n\treturn 1;\n}\n\n\nint AddArry(Temp* p, EM data) {\n\tif (p->lenght >=MaxArry) return 0;\n\tp->data[p->lenght] = data;\n\tp->lenght++;\n\treturn 1;\n}\n\nint InsertArry(Temp* p, int c, EM data) {\n\tif (c< 1 || p->lenght>=MaxArry||c>=MaxArry-1) return 0;\n\tfor (int i = p->lenght-1; i >=c; i--) {\n\t\tp->data[i + 1] = p->data[i];\n\t}\n\tp->data[c] = data;\n\tp->lenght++;\n\treturn 1;\n}\n\nint DeletArry(Temp* p, int c, EM* data) {\n\tif (c > MaxArry) return 0;\n\t*data = p->data[c - 1];\n\tfor (int i = c - 1; i < p->lenght - 1; i++) {\n\t\tp->data[i] = p->data[i + 1];\n\t}\n\tp->lenght--;\n\treturn 1;\n}\n\n\nint main(void)\n{\n\tEM jicun;\n\tTemp* ary = InitArry();\n\tInsertChain(ary,10);\n\tInsertChain(ary, 20);\n\tInsertChain(ary, 30);\n\tInsertChain(ary, 40);\n\tListArry(ary);\n}\n\n<\/code><\/pre>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u5c3e\u63d2\u5165\u5f0f<\/h3>\n\n\n\n
#include <stdio.h>\n#include <stdlib.h>\n\n#define MaxArry 100\n\ntypedef int EM;\n\n\n\/\/\u521b\u5efa\u7ed3\u6784\u4f53\ntypedef struct temp{\n\ttemp* last;\n\tEM* data;\n\ttemp* next;\n\tint lenght;\n}Temp;\n\n\n\/\/\u521d\u59cb\u5316\u7ed3\u6784\u4f53\nTemp* InitArry() {\n\tTemp* L = (Temp*)malloc(sizeof(Temp));\t\n\tL->data = (EM*)malloc(sizeof(EM)*MaxArry+1);\n\tL->last = NULL;\n\tL->next = NULL;\n\tL->lenght = 0;\n\treturn L;\n}\n\n\/\/\u5934\u63d2\u5165\u5f0f\u94fe\u8868\nvoid InsertHead(Temp* p,EM data) {\n\tTemp* L = (Temp*)malloc(sizeof(Temp));\n\tL->data = (EM*)malloc(sizeof(EM) * MaxArry + 1);\n\tL->data[0] = data;\n\tL->lenght = 0;\n\tL->last = p;\n\tL->next = p->next;\n\tp->next = L;\n}\n\/\/\u904d\u5386\u94fe\u8868\nint ListArry(Temp* p) {\n\tTemp* nxt = p->next;\n\twhile (nxt != NULL) {\n\t\tprintf(\"%d\\r\\n\", nxt->data[0]);\n\t\tnxt = nxt->next;\n\t}\n\treturn 1;\n}\n\/\/\u904d\u5386\u8fd4\u56de\u5c3e\u8282\u70b9\nTemp* SerchTail(Temp* p) {\n\tTemp* L = p;\n\twhile (L->next != NULL) {\n\t\tL = L->next;\n\t}\n\treturn L;\n}\n\n\/\/\u63d2\u5165\u5c3e\u8282\u70b9(p\u8981\u4e3a\u5c3e\u8282\u70b9)\nTemp* InsertTail(Temp* p, EM data) {\n\tTemp* L = (Temp*)malloc(sizeof(Temp));\n\tL->data = (EM*)malloc(sizeof(EM)*MaxArry);\n\tL->data[0] = data;\n\tL->lenght = 0;\n\tp->next = L;\n\tL->next = NULL;\n\treturn L;\n}\n\nint main(void)\n{\n\tEM jicun;\n\tTemp* ary = InitArry();\n\tTemp* tail = SerchTail(ary);\n\ttail = InsertTail(tail, 30);\n\ttail = InsertTail(tail, 40);\n\ttail = InsertTail(tail, 50);\n\ttail = InsertTail(tail, 60);\n\tListArry(ary);\n}\n\n<\/code><\/pre>\n\n\n\n
\u5e94\u7528<\/h3>\n\n\n\n
\u5feb\u901f\u67e5\u8be2<\/h4>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
#include<stdio.h>\n#include<stdlib.h>\ntypedef int EM;\ntypedef struct Node {\n\tEM* data;\n\tNode* link;\n}Node;\n\nNode* InitChain() {\n\tNode* L = (Node*)malloc(sizeof(Node*));\n\tL->data = (EM*)malloc(sizeof(EM));\n\tL->link = NULL;\n\treturn L;\n}\n\/\/\u5c3e\u63d2\u5f0f\u94fe\n\/\/p\uff1a\u4e3a\u6700\u540e\u4e00\u4e2a\u94fe\n\/\/data\uff1a\u4f20\u5165\u6570\u636e\nNode* InsertTail(Node* p, EM data) {\n\tNode* NewChian = (Node*)malloc(sizeof(Node*));\n\tNewChian->data = (EM*)malloc(sizeof(EM*));\n\tp->link = NewChian;\n\t*(NewChian->data) = data;\n\tNewChian->link = NULL;\n\treturn NewChian;\n}\n\n\/\/\u627e\u5c3e\u94fe\n\nNode* SerchTail(Node* p) {\n\tNode* tail = p;\n\twhile (tail->link != NULL) {\n\t\ttail = tail->link;\n\t}\n\treturn tail;\n}\n\n\/\/\u67e5\u627e\u5012\u6570K\u4e2a\u503c\u4e2d\u7684\u94fedata\u503c\n\nEM SerchData(Node* p, int k) {\n\tNode* S = p->link;\n\tint cunt = 0;\n\twhile (S != NULL) {\n\t\tcunt++;\n\t\tS = S->link;\n\t}\n\tS = p->link;\n\twhile (cunt > k) {\n\t\tcunt--;\n\t\tS = S->link;\n\t}\n\treturn S->data[0];\n}\n\n\n\/\/\u5feb\u6162\u6307\u9488\nEM SerchData2(Node* p,int data) {\n\tNode* fast = p->link;\n\tNode* slow = p->link;\n\tfor (int i = 0; i < data; i++) {\n\t\tfast = fast->link;\n\t}\n\twhile (fast != NULL) {\n\t\tfast = fast->link;\n\t\tslow = slow->link;\n\t}\n\treturn slow->data[0];\n}\n\n\n\n\n\/\/\u904d\u5386\u94fe\nint ListChian(Node* p) {\n\tNode* L = p->link;\n\twhile (L != NULL) {\n\t\tprintf(\"%d\\r\\n\", L->data[0]);\n\t\tL = L->link;\n\t}\n\treturn 1;\n}\n\n\n\nint main2(void) {\n\t\n\tNode* ary = InitChain();\n\tNode* tail = SerchTail(ary);\n\ttail = InsertTail(tail, 30);\n\ttail = InsertTail(tail, 50);\n\ttail = InsertTail(tail, 60);\n\ttail = InsertTail(tail, 70);\n\ttail = InsertTail(tail, 80);\n\ttail = InsertTail(tail, 90);\n\ttail = InsertTail(tail, 100);\n\tListChian(ary);\n\tprintf(\"\u90a3\u4e2a\u6570\u662f:%d\\r\\n\",SerchData2(ary, 3));\n\treturn 0;\n}<\/code><\/pre>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
#include<stdio.h>\n#include<stdlib.h>\ntypedef char EM;\ntypedef struct Node {\n\tEM* data;\n\tNode* link;\n}Node;\n\nstatic Node* InitChain() {\n\tNode* L = (Node*)malloc(sizeof(Node*));\n\tL->data = (EM*)malloc(sizeof(EM));\n\tL->link = NULL;\n\treturn L;\n}\n\/\/\u5c3e\u63d2\u5f0f\u94fe\n\/\/p\uff1a\u4e3a\u6700\u540e\u4e00\u4e2a\u94fe\n\/\/data\uff1a\u4f20\u5165\u6570\u636e\nstatic Node* InsertTail(Node* p, EM data) {\n\tNode* NewChian = (Node*)malloc(sizeof(Node*));\n\tNewChian->data = (EM*)malloc(sizeof(EM*));\n\tp->link = NewChian;\n\t*(NewChian->data) = data;\n\tNewChian->link = NULL;\n\treturn NewChian;\n}\n\n\/\/\u627e\u5c3e\u94fe\n\nstatic Node* SerchTail(Node* p) {\n\tNode* tail = p;\n\twhile (tail->link != NULL) {\n\t\ttail = tail->link;\n\t}\n\treturn tail;\n}\n\n\n\/\/\u6570\u4e2a\u6570\nstatic int CuntChain(Node* p) {\n\tNode* i = p->link;\n\tint cunt = 0;\n\twhile (i != NULL) {\n\t\tcunt++;\n\t\ti = i->link;\n\t}\n\treturn cunt;\n}\n\n\n\/\/\u627e\u5c3e\u7f00\u76f8\u540c\u94fe\nstatic EM SerchAsChain(Node* p, Node* k) {\n\tNode* fast = p->link;\n\tNode* slow = k->link;\n\tint inum  = CuntChain(p);\n\tint knum = CuntChain(k);\n\tint less = abs(inum - knum);\n\tfor (int i = 0; i < less; i++) {\n\t\tfast = fast->link;\n\t}\n\twhile (fast != slow) {\n\t\tfast = fast->link;\n\t\tslow = slow->link;\n\t}\n\treturn slow->data[0];\n}\n\n\n\n\n\n\n\/\/\u904d\u5386\u94fe\nstatic int ListChian(Node* p) {\n\tNode* L = p->link;\n\twhile (L != NULL) {\n\t\tprintf(\"%c\\r\\n\", L->data[0]);\n\t\tL = L->link;\n\t}\n\treturn 1;\n}\n\n\n\nint main(void) {\n\n\tNode* ary = InitChain();\n\tNode* ary1 = InitChain();\n\tNode* last = InitChain();\n\n\tNode* ttl = SerchTail(last);\n\tttl = InsertTail(ttl, 'i');\n\tttl = InsertTail(ttl, 'n');\n\tttl = InsertTail(ttl, 'g');\n\n\tNode* tail = SerchTail(ary);\n\ttail = InsertTail(tail, 'l');\n\ttail = InsertTail(tail, 'o');\n\ttail = InsertTail(tail, 'a');\n\ttail = InsertTail(tail, 'd');\n\ttail->link = last ->link;\n\ttail = SerchTail(ary1);\n\ttail = InsertTail(tail, 'b');\n\ttail = InsertTail(tail, 'e');\n\ttail->link = last->link;\n\n\n\tListChian(ary);\n\tListChian(ary1);\n\tprintf(\"\u90a3\u4e2a\u6570\u662f:%c\\r\\n\", SerchAsChain(ary, ary1));\n\n\treturn 0;\n}<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
&\u53d6\u5730\u5740 \u3001\uff08char*,short*,int*,long*\uff09\u4e3a\u6570\u636e\u7c7b\u578b\u6307\u9488\u3001(*p,*a,&#823 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[31],"tags":[],"class_list":["post-556","post","type-post","status-publish","format-standard","hentry","category-31"],"_links":{"self":[{"href":"\/index.php?rest_route=\/wp\/v2\/posts\/556"}],"collection":[{"href":"\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=556"}],"version-history":[{"count":16,"href":"\/index.php?rest_route=\/wp\/v2\/posts\/556\/revisions"}],"predecessor-version":[{"id":752,"href":"\/index.php?rest_route=\/wp\/v2\/posts\/556\/revisions\/752"}],"wp:attachment":[{"href":"\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=556"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=556"},{"taxonomy":"post_tag","embeddable":true,"href":"\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=556"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}