{"id":789,"date":"2024-11-07T12:37:22","date_gmt":"2024-11-07T04:37:22","guid":{"rendered":"https:\/\/fwq.ai\/blog\/789\/"},"modified":"2024-11-07T12:37:22","modified_gmt":"2024-11-07T04:37:22","slug":"c%e8%af%ad%e8%a8%80%e6%95%b0%e6%8d%ae%e7%bb%93%e6%9e%84%ef%bc%9a%e5%b8%b8%e8%a7%81%e9%9d%a2%e8%af%95%e9%97%ae%e9%a2%98%e5%89%96%e6%9e%90","status":"publish","type":"post","link":"https:\/\/fwq.ai\/blog\/789\/","title":{"rendered":"C\u8bed\u8a00\u6570\u636e\u7ed3\u6784\uff1a\u5e38\u89c1\u9762\u8bd5\u95ee\u9898\u5256\u6790"},"content":{"rendered":"<p>\u6570\u636e\u7ed3\u6784\u662f c \u8bed\u8a00\u9762\u8bd5\u4e2d\u7684\u5173\u952e\u77e5\u8bc6\u70b9\uff1a\u6307\u9488\u548c\u6570\u7ec4\uff1a\u7406\u89e3\u6307\u9488\u6307\u5411\u6570\u7ec4\u8d77\u59cb\u5730\u5740\u5e76\u7528\u4e8e\u8bbf\u95ee\u548c\u4fee\u6539\u6570\u7ec4\u5143\u7d20\u3002\u94fe\u8868\uff1a\u5b9e\u73b0\u5355\u5411\u94fe\u8868\uff0c\u638c\u63e1\u521b\u5efa\u3001\u63d2\u5165\u548c\u5220\u9664\u64cd\u4f5c\u3002\u6808\uff1a\u5229\u7528\u6570\u7ec4\u6784\u5efa\u6808\uff0c\u7406\u89e3\u538b\u6808\u3001\u51fa\u6808\u548c\u67e5\u770b\u6808\u9876\u64cd\u4f5c\u3002\u961f\u5217\uff1a\u4f7f\u7528\u6570\u7ec4\u5b9e\u73b0\u961f\u5217\uff0c\u638c\u63e1\u5165\u961f\u3001\u51fa\u961f\u548c\u67e5\u770b\u961f\u9996\u64cd\u4f5c\u3002<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"alignnone size-full wp-image-1115\" src=\"https:\/\/fwq.ai\/blog\/wp-content\/uploads\/2024\/11\/172903824221893.jpg\" width=\"720\" height=\"288\" srcset=\"https:\/\/fwq.ai\/blog\/wp-content\/uploads\/2024\/11\/172903824221893.jpg 720w, https:\/\/fwq.ai\/blog\/wp-content\/uploads\/2024\/11\/172903824221893-300x120.jpg 300w, https:\/\/fwq.ai\/blog\/wp-content\/uploads\/2024\/11\/172903824221893-670x268.jpg 670w\" sizes=\"auto, (max-width: 720px) 100vw, 720px\" title=\"C\u8bed\u8a00\u6570\u636e\u7ed3\u6784\uff1a\u5e38\u89c1\u9762\u8bd5\u95ee\u9898\u5256\u6790\u63d2\u56fe\" alt=\"C\u8bed\u8a00\u6570\u636e\u7ed3\u6784\uff1a\u5e38\u89c1\u9762\u8bd5\u95ee\u9898\u5256\u6790\u63d2\u56fe\" \/><\/p>\n<h2>C \u8bed\u8a00\u6570\u636e\u7ed3\u6784\uff1a\u5e38\u89c1\u9762\u8bd5\u95ee\u9898\u5256\u6790<\/h2>\n<p>\u5728\u8bb8\u591a\u7f16\u7a0b\u9762\u8bd5\u4e2d\uff0c\u6570\u636e\u7ed3\u6784\u90fd\u662f\u4e0d\u53ef\u907f\u514d\u7684\u8bdd\u9898\u3002\u638c\u63e1 C \u8bed\u8a00\u4e2d\u7684\u5e38\u89c1\u6570\u636e\u7ed3\u6784\u53ca\u5176\u5e94\u7528\u5bf9\u4e8e\u6c42\u804c\u8005\u6765\u8bf4\u81f3\u5173\u91cd\u8981\u3002<\/p>\n<p><strong>1. \u6307\u9488\u548c\u6570\u7ec4<\/strong><\/p>\n<ul>\n<li>\n<p>\u7406\u89e3\u6307\u9488\u6307\u5411\u6570\u7ec4\u8d77\u59cb\u5730\u5740\u7684\u539f\u7406\u3002<\/p>\n<p><span>\u7acb\u5373\u5b66\u4e60<\/span>\u201cC\u8bed\u8a00\u514d\u8d39\u5b66\u4e60\u7b14\u8bb0\uff08\u6df1\u5165\uff09\u201d\uff1b<\/p>\n<pre>int arr[] = {1, 2, 3, 4, 5};\nint *ptr = arr;  \/\/ \u6307\u5411\u6570\u7ec4\u9996\u5143\u7d20<\/pre>\n<p> \u767b\u5f55\u540e\u590d\u5236 <\/li>\n<li>\n<p>\u4f7f\u7528\u6307\u9488\u8bbf\u95ee\u548c\u4fee\u6539\u6570\u7ec4\u5143\u7d20\u3002<\/p>\n<pre>printf(\"%d\n\", *ptr);  \/\/ \u8f93\u51fa 1\n*ptr++;  \/\/ \u6307\u5411\u4e0b\u4e00\u4e2a\u6570\u7ec4\u5143\u7d20\nprintf(\"%d\n\", *ptr);  \/\/ \u8f93\u51fa 2<\/pre>\n<p> \u767b\u5f55\u540e\u590d\u5236 <\/li>\n<\/ul>\n<p><strong>2. \u94fe\u8868<\/strong><\/p>\n<ul>\n<li>\n<p>\u5b9e\u73b0\u5355\u5411\u94fe\u8868\u53ca\u5176\u57fa\u672c\u64cd\u4f5c\uff08\u521b\u5efa\u3001\u63d2\u5165\u3001\u5220\u9664\uff09\u3002<\/p>\n<pre>struct node {\n  int data;\n  struct node *next;\n};\n\nstruct node *head = NULL;  \/\/ \u94fe\u8868\u5934\u90e8\n\n\/\/ \u521b\u5efa\u94fe\u8868\nvoid create_list(int data) {\n  struct node *new_node = malloc(sizeof(struct node));\n  new_node-&amp;gt;data = data;\n  new_node-&amp;gt;next = NULL;\n\n  if (head == NULL) {\n      head = new_node;\n  } else {\n      struct node *current = head;\n      while (current-&amp;gt;next != NULL) {\n          current = current-&amp;gt;next;\n      }\n      current-&amp;gt;next = new_node;\n  }\n}\n\n\/\/ \u63d2\u5165\u8282\u70b9\u5230\u94fe\u8868\u7279\u5b9a\u4f4d\u7f6e\nvoid insert_node(int data, int position) {\n  struct node *new_node = malloc(sizeof(struct node));\n  new_node-&amp;gt;data = data;\n\n  if (position == 0) {\n      new_node-&amp;gt;next = head;\n      head = new_node;\n  } else {\n      struct node *current = head;\n      for (int i = 0; i next;\n      }\n\n      if (current != NULL) {\n          new_node-&amp;gt;next = current-&amp;gt;next;\n          current-&amp;gt;next = new_node;\n      }\n  }\n}\n\n\/\/ \u5220\u9664\u94fe\u8868\u7279\u5b9a\u4f4d\u7f6e\u7684\u8282\u70b9\nvoid delete_node(int position) {\n  struct node *current = head;\n\n  if (position == 0) {\n      head = head-&amp;gt;next;\n  } else {\n      for (int i = 0; i next;\n      }\n\n      if (current != NULL &amp;amp;&amp;amp; current-&amp;gt;next != NULL) {\n          struct node *temp = current-&amp;gt;next;\n          current-&amp;gt;next = temp-&amp;gt;next;\n          free(temp);\n      }\n  }\n}<\/pre>\n<p> \u767b\u5f55\u540e\u590d\u5236 <\/li>\n<\/ul>\n<p><strong>3. \u6808<\/strong><\/p>\n<ul>\n<li>\n<p>\u5b9e\u73b0\u6808\u5e76\u4f7f\u7528\u6570\u7ec4\u6a21\u62df\uff0c\u7406\u89e3\u6808\u7684\u57fa\u672c\u64cd\u4f5c\uff08\u538b\u6808\u3001\u51fa\u6808\u3001\u67e5\u770b\u6808\u9876\uff09\u3002<\/p>\n<pre>#define MAX_SIZE 100\n\nint stack[MAX_SIZE];\nint top = -1;  \/\/ \u6808\u9876\u6307\u9488\n\n\/\/ \u538b\u6808\nvoid push(int data) {\n  if (top == MAX_SIZE - 1) {\n      printf(\"Stack overflow\n\");\n  } else {\n      stack[++top] = data;\n  }\n}\n\n\/\/ \u51fa\u6808\nint pop() {\n  if (top == -1) {\n      printf(\"Stack underflow\n\");\n      return -1;\n  } else {\n      return stack[top--];\n  }\n}\n\n\/\/ \u67e5\u770b\u6808\u9876\u5143\u7d20\nint peek() {\n  if (top == -1) {\n      printf(\"Empty stack\n\");\n      return -1;\n  } else {\n      return stack[top];\n  }\n}<\/pre>\n<p> \u767b\u5f55\u540e\u590d\u5236 <\/li>\n<\/ul>\n<p><strong>4. \u961f\u5217<\/strong><\/p>\n<ul>\n<li>\n<p>\u4f7f\u7528\u6570\u7ec4\u5b9e\u73b0\u961f\u5217\uff0c\u7406\u89e3\u961f\u5217\u7684\u57fa\u672c\u64cd\u4f5c\uff08\u5165\u961f\u3001\u51fa\u961f\u3001\u67e5\u770b\u961f\u9996\uff09\u3002<\/p>\n<pre>#define MAX_SIZE 100\n\nint queue[MAX_SIZE];\nint front = -1, rear = -1;\n\n\/\/ \u5165\u961f\nvoid enqueue(int data) {\n  if ((front == 0 &amp;amp;&amp;amp; rear == MAX_SIZE - 1) || (rear + 1 == front)) {\n      printf(\"Queue overflow\n\");\n  } else if (front == -1) {\n      front = rear = 0;\n      queue[rear] = data;\n  } else if (rear == MAX_SIZE - 1) {\n      rear = 0;\n      queue[rear] = data;\n  } else {\n      rear++;\n      queue[rear] = data;\n  }\n}\n\n\/\/ \u51fa\u961f\nint dequeue() {\n  if (front == -1) {\n      printf(\"Queue underflow\n\");\n      return -1;\n  } else if (front == rear) {\n      int data = queue[front];\n      front = rear = -1;\n      return data;\n  } else {\n      int data = queue[front];\n      front++;\n      return data;\n  }\n}\n\n\/\/ \u67e5\u770b\u961f\u9996\u5143\u7d20\nint peek() {\n  if (front == -1) {\n      printf(\"Queue empty\n\");\n      return -1;\n  } else {\n      return queue[front];\n  }\n}<\/pre>\n<p> \u767b\u5f55\u540e\u590d\u5236 <\/li>\n<\/ul>\n<p>\u4ee5\u4e0a\u5c31\u662fC\u8bed\u8a00\u6570\u636e\u7ed3\u6784\uff1a\u5e38\u89c1\u9762\u8bd5\u95ee\u9898\u5256\u6790\u7684\u8be6\u7ec6\u5185\u5bb9\uff0c\u66f4\u591a\u8bf7\u5173\u6ce8\u7c73\u4e91\u5176\u5b83\u76f8\u5173\u6587\u7ae0\uff01<\/p>\n","protected":false},"excerpt":{"rendered":"<p>\u6570\u636e\u7ed3\u6784\u662f c \u8bed\u8a00\u9762\u8bd5\u4e2d\u7684\u5173\u952e\u77e5\u8bc6\u70b9\uff1a\u6307\u9488\u548c\u6570\u7ec4\uff1a\u7406\u89e3\u6307\u9488\u6307\u5411\u6570\u7ec4\u8d77\u59cb\u5730\u5740\u5e76\u7528\u4e8e\u8bbf\u95ee\u548c\u4fee\u6539\u6570\u7ec4\u5143\u7d20\u3002\u94fe\u8868\uff1a\u5b9e\u73b0\u5355\u5411\u94fe\u8868\uff0c\u638c\u63e1\u521b\u5efa\u3001\u63d2\u5165\u548c\u5220\u9664\u64cd\u4f5c\u3002\u6808\uff1a\u5229\u7528\u6570\u7ec4\u6784\u5efa\u6808\uff0c\u7406\u89e3\u538b\u6808\u3001\u51fa\u6808\u548c\u67e5\u770b\u6808\u9876\u64cd\u4f5c\u3002\u961f\u5217\uff1a\u4f7f\u7528\u6570\u7ec4\u5b9e\u73b0\u961f\u5217\uff0c\u638c\u63e1\u5165\u961f\u3001\u51fa\u961f\u548c\u67e5\u770b\u961f\u9996\u64cd\u4f5c\u3002 C \u8bed\u8a00\u6570\u636e\u7ed3\u6784\uff1a\u5e38\u89c1\u9762\u8bd5\u95ee\u9898\u5256\u6790 \u5728\u8bb8\u591a\u7f16\u7a0b\u9762\u8bd5\u4e2d\uff0c\u6570\u636e\u7ed3\u6784\u90fd\u662f\u4e0d\u53ef\u907f\u514d\u7684\u8bdd\u9898\u3002\u638c\u63e1 C \u8bed\u8a00\u4e2d\u7684\u5e38\u89c1\u6570\u636e\u7ed3\u6784\u53ca\u5176\u5e94\u7528\u5bf9\u4e8e\u6c42\u804c\u8005\u6765\u8bf4\u81f3\u5173\u91cd\u8981\u3002 1. \u6307\u9488\u548c\u6570\u7ec4 \u7406\u89e3\u6307\u9488\u6307\u5411\u6570\u7ec4\u8d77\u59cb\u5730\u5740\u7684\u539f\u7406\u3002 \u7acb\u5373\u5b66\u4e60\u201cC\u8bed\u8a00\u514d\u8d39\u5b66\u4e60\u7b14\u8bb0\uff08\u6df1\u5165\uff09\u201d\uff1b int arr[] = {1, 2, 3, 4, 5}; int *ptr = arr; \/\/ \u6307\u5411\u6570\u7ec4\u9996\u5143\u7d20 \u767b\u5f55\u540e\u590d\u5236 \u4f7f\u7528\u6307\u9488\u8bbf\u95ee\u548c\u4fee\u6539\u6570\u7ec4\u5143\u7d20\u3002 printf(&#8220;%d &#8220;, *ptr); \/\/ \u8f93\u51fa 1 *ptr++; \/\/ \u6307\u5411\u4e0b\u4e00\u4e2a\u6570\u7ec4\u5143\u7d20 printf(&#8220;%d &#8220;, *ptr); \/\/ \u8f93\u51fa 2 \u767b\u5f55\u540e\u590d\u5236 2. \u94fe\u8868 \u5b9e\u73b0\u5355\u5411\u94fe\u8868\u53ca\u5176\u57fa\u672c\u64cd\u4f5c\uff08\u521b\u5efa\u3001\u63d2\u5165\u3001\u5220\u9664\uff09\u3002 struct node { int data; struct node *next; [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[16],"tags":[],"class_list":["post-789","post","type-post","status-publish","format-standard","hentry","category-16"],"_links":{"self":[{"href":"https:\/\/fwq.ai\/blog\/wp-json\/wp\/v2\/posts\/789","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/fwq.ai\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/fwq.ai\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/fwq.ai\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/fwq.ai\/blog\/wp-json\/wp\/v2\/comments?post=789"}],"version-history":[{"count":0,"href":"https:\/\/fwq.ai\/blog\/wp-json\/wp\/v2\/posts\/789\/revisions"}],"wp:attachment":[{"href":"https:\/\/fwq.ai\/blog\/wp-json\/wp\/v2\/media?parent=789"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fwq.ai\/blog\/wp-json\/wp\/v2\/categories?post=789"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fwq.ai\/blog\/wp-json\/wp\/v2\/tags?post=789"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}