\u8fd9\u7ae0\u8bb2\u89e3\u4e86\u961f\u5217\u7684\u77e5\u8bc6，\u6811\u5f62\u7ed3\u6784\u7684\u57fa\u672c\u6982\u5ff5，\u4ee5\u53ca\u4e8c\u53c9\u6811\u7684\u57fa\u7840\u90e8\u5206\u4ee5\u53ca\u76f8\u5173\u7684\u6982\u5ff5，\u4f8b\u5982\u6839\u636e\u524d\u5e8f\u548c\u4e2d\u5e8f，\u8ba1\u7b97\u540e\u5e8f\u7b49<\/p>\n
\u4ece\u961f\u5217\u5230\u4e8c\u53c9\u6811 \u6570\u636e\u7ed3\u6784\u5165\u95e8\u6838\u5fc3\u8109\u7edc\u89e3\u6790<\/p>\n
\u4eca\u5929\u6211\u4eec\u4ece\u4e24\u4e2a\u7ecf\u5178\u6570\u636e\u7ed3\u6784\u5165\u624b \u961f\u5217\u548c\u4e8c\u53c9\u6811 \u4e32\u8054\u8bb2\u89e3\u5b83\u4eec\u7684\u6838\u5fc3\u6982\u5ff5\u4e0e\u5e94\u7528 \u5c24\u5176\u4f1a\u6df1\u5165\u5256\u6790\u4e8c\u53c9\u6811\u4e2d\u524d\u5e8f\u4e2d\u5e8f\u6c42\u540e\u5e8f\u7684\u7ecf\u5178\u95ee\u9898 \u8ba9\u4f60\u5f7b\u5e95\u641e\u61c2\u9012\u5f52\u4e0e\u6811\u7684\u903b\u8f91<\/p>\n
\u961f\u5217\u662f\u4e00\u79cd\u7ebf\u6027\u6570\u636e\u7ed3\u6784 \u7279\u70b9\u662f\u5148\u8fdb\u5148\u51faFIFO \u50cf\u751f\u6d3b\u4e2d\u6392\u961f\u4e70\u7968 \u5148\u6765\u7684\u4eba\u5148\u4e70\u5230\u7968\u79bb\u5f00 \u540e\u6765\u7684\u4eba\u6392\u5728\u961f\u5c3e \u961f\u5217\u6709\u4e24\u4e2a\u5173\u952e\u7aef \u961f\u5934\u51fa\u961f \u961f\u5c3e\u5165\u961f<\/p>\n
\u5165\u961fenqueue \u5728\u961f\u5c3e\u6dfb\u52a0\u5143\u7d20 \u51fa\u961fdequeue \u5728\u961f\u5934\u79fb\u9664\u5143\u7d20 \u5224\u7a7aisEmpty \u5224\u65ad\u961f\u5217\u662f\u5426\u6709\u5143\u7d20 \u5224\u6ee1isFull \u5224\u65ad\u961f\u5217\u662f\u5426\u5df2\u6ee1<\/p>\n
\u7528\u6570\u7ec4\u5b9e\u73b0\u961f\u5217\u65f6 \u4e3a\u907f\u514d\u5047\u6ea2\u51fa \u5e38\u7528\u5faa\u73af\u6570\u7ec4 \u5373\u6570\u7ec4\u9996\u5c3e\u76f8\u8fde \u7528\u4e24\u4e2a\u6307\u9488front\u961f\u5934 rear\u961f\u5c3e\u6807\u8bb0\u4f4d\u7f6e<\/p>\n
#include <stdio.h>
\n#define MAX_SIZE 5 \/\/ \u961f\u5217\u6700\u5927\u5bb9\u91cf<\/p>\n
\/\/ \u961f\u5217\u7ed3\u6784\u4f53
\ntypedef struct {
\n int data[MAX_SIZE]; \/\/ \u5b58\u50a8\u5143\u7d20\u7684\u6570\u7ec4
\n int front; \/\/ \u961f\u5934\u6307\u9488 \u6307\u5411\u961f\u5934\u5143\u7d20
\n int rear; \/\/ \u961f\u5c3e\u6307\u9488 \u6307\u5411\u961f\u5c3e\u4e0b\u4e00\u4e2a\u4f4d\u7f6e
\n} Queue;<\/p>\n
\/\/ \u521d\u59cb\u5316\u961f\u5217
\nvoid initQueue(Queue *q) {
\n q->front = 0;
\n q->rear = 0;
\n}<\/p>\n
\/\/ \u5224\u7a7a \u961f\u5934\u961f\u5c3e\u91cd\u5408\u4e14\u672a\u5b58\u5143\u7d20\u65f6\u4e3a\u7a7a
\nint isEmpty(Queue *q) {
\n return q->front == q->rear;
\n}<\/p>\n
\/\/ \u5224\u6ee1 \u961f\u5c3e\u4e0b\u4e00\u4e2a\u4f4d\u7f6e\u662f\u961f\u5934\u65f6\u6ee1 (\u5faa\u73af)
\nint isFull(Queue *q) {
\n return (q->rear + 1) % MAX_SIZE == q->front;
\n}<\/p>\n
\/\/ \u5165\u961f
\nint enqueue(Queue *q, int val) {
\n if (isFull(q)) {
\n printf("\u961f\u5217\u5df2\u6ee1 \u65e0\u6cd5\u5165\u961f\\\\n");
\n return 0; \/\/ \u5931\u8d25
\n }
\n q->data[q->rear] = val;
\n q->rear = (q->rear + 1) % MAX_SIZE; \/\/ \u961f\u5c3e\u5faa\u73af\u540e\u79fb
\n return 1; \/\/ \u6210\u529f
\n}<\/p>\n
\/\/ \u51fa\u961f
\nint dequeue(Queue *q, int *val) {
\n if (isEmpty(q)) {
\n printf("\u961f\u5217\u4e3a\u7a7a \u65e0\u6cd5\u51fa\u961f\\\\n");
\n return 0; \/\/ \u5931\u8d25
\n }
\n *val = q->data[q->front];
\n q->front = (q->front + 1) % MAX_SIZE; \/\/ \u961f\u5934\u5faa\u73af\u540e\u79fb
\n return 1; \/\/ \u6210\u529f
\n}<\/p>\n
\/\/ \u793a\u4f8b \u6a21\u62df\u6392\u961f
\nvoid queueExample() {
\n Queue q;
\n initQueue(&q);
\n enqueue(&q, 10); \/\/ \u961f\u5c3e\u5165\u961f10
\n enqueue(&q, 20); \/\/ \u5165\u961f20
\n enqueue(&q, 30); \/\/ \u5165\u961f30
\n int val;
\n dequeue(&q, &val); \/\/ \u961f\u5934\u51fa\u961f10
\n printf("\u51fa\u961f\u5143\u7d20 %d\\\\n", val); \/\/ \u8f93\u51fa10
\n enqueue(&q, 40);
\n enqueue(&q, 50);
\n enqueue(&q, 60); \/\/ \u6b64\u65f6\u961f\u5217\u6ee1 \u65e0\u6cd5\u5165\u961f
\n} <\/p>\n
\u6811\u662f\u975e\u7ebf\u6027\u6570\u636e\u7ed3\u6784 \u50cf\u5012\u8fc7\u6765\u7684\u6811 \u6709\u6839\u8282\u70b9 \u6bcf\u4e2a\u8282\u70b9\u6709\u96f6\u4e2a\u6216\u591a\u4e2a\u5b50\u8282\u70b9 \u5b50\u8282\u70b9\u4e0b\u8fd8\u6709\u5b50\u6811 \u6700\u4e0a\u9762\u662f\u6839 \u6700\u4e0b\u9762\u662f\u53f6\u5b50<\/p>\n
\u8282\u70b9 \u6811\u7684\u57fa\u672c\u5355\u4f4d \u5ea6 \u8282\u70b9\u62e5\u6709\u7684\u5b50\u8282\u70b9\u6570 \u53f6\u5b50\u8282\u70b9 \u5ea6\u4e3a0\u7684\u8282\u70b9 \u53cc\u4eb2 \u7236\u8282\u70b9 \u5b69\u5b50 \u5b50\u8282\u70b9 \u5144\u5f1f \u540c\u4e00\u53cc\u4eb2\u7684\u5b50\u8282\u70b9 \u5c42\u6b21 \u6839\u662f\u7b2c\u4e00\u5c42 \u5f80\u4e0b\u9012\u589e \u6df1\u5ea6 \u6811\u7684\u6700\u5927\u5c42\u6b21 \u68ee\u6797 \u591a\u68f5\u4e92\u4e0d\u76f8\u4ea4\u7684\u6811<\/p>\n
\u5bb6\u65cf\u6811 \u6839\u662f\u7956\u5148 \u5b69\u5b50\u662f\u540e\u4ee3 \u516c\u53f8\u67b6\u6784 \u6839\u662fCEO \u5b50\u6811\u662f\u5404\u90e8\u95e8<\/p>\n
\u4e8c\u53c9\u6811\u662f\u6bcf\u4e2a\u8282\u70b9\u6700\u591a\u6709\u4e24\u68f5\u5b50\u6811\u7684\u6811 \u5206\u522b\u53eb\u5de6\u5b50\u6811\u548c\u53f3\u5b50\u6811 \u5b50\u6811\u6709\u987a\u5e8f \u4e0d\u80fd\u98a0\u5012<\/p>\n
\u6ee1\u4e8c\u53c9\u6811 \u6bcf\u5c42\u8282\u70b9\u90fd\u6ee1 \u6df1\u5ea6k\u67092^k 1\u4e2a\u8282\u70b9 \u5b8c\u5168\u4e8c\u53c9\u6811 \u9664\u6700\u540e\u4e00\u5c42 \u5176\u4f59\u5c42\u6ee1 \u6700\u540e\u4e00\u5c42\u8282\u70b9\u9760\u5de6\u6392\u5217<\/p>\n
\u7b2ci\u5c42\u6700\u591a\u67092^i 1\u4e2a\u8282\u70b9 \u6df1\u5ea6\u4e3ak\u7684\u4e8c\u53c9\u6811\u6700\u591a\u67092^k 1\u4e2a\u8282\u70b9 \u5bf9\u4efb\u610f\u4e8c\u53c9\u6811 \u53f6\u5b50\u6570 \u5ea6\u4e3a2\u7684\u8282\u70b9\u6570 1<\/p>\n
\u524d\u5e8f\u904d\u5386 \u6839\u5de6\u53f3 \u5148\u8bbf\u95ee\u6839 \u518d\u5de6\u5b50\u6811 \u518d\u53f3\u5b50\u6811 \u4e2d\u5e8f\u904d\u5386 \u5de6\u6839\u53f3 \u5148\u5de6\u5b50\u6811 \u518d\u6839 \u518d\u53f3\u5b50\u6811 \u540e\u5e8f\u904d\u5386 \u5de6\u53f3\u6839 \u5148\u5de6\u5b50\u6811 \u518d\u53f3\u5b50\u6811 \u518d\u6839 \u5c42\u5e8f\u904d\u5386 \u6309\u5c42\u6b21\u4ece\u5de6\u5230\u53f3\u8bbf\u95ee<\/p>\n
\/\/ \u4e8c\u53c9\u6811\u8282\u70b9\u7ed3\u6784\u4f53
\ntypedef struct TreeNode {
\n int val; \/\/ \u8282\u70b9\u503c
\n struct TreeNode *left; \/\/ \u5de6\u5b50\u6811
\n struct TreeNode *right; \/\/ \u53f3\u5b50\u6811
\n} TreeNode;<\/p>\n
\/\/ \u524d\u5e8f\u904d\u5386 \u6839\u5de6\u53f3
\nvoid preorder(TreeNode *root) {
\n if (root == NULL) return;
\n printf("%d ", root->val); \/\/ \u8bbf\u95ee\u6839
\n preorder(root->left); \/\/ \u5de6\u5b50\u6811
\n preorder(root->right); \/\/ \u53f3\u5b50\u6811
\n}<\/p>\n
\/\/ \u4e2d\u5e8f\u904d\u5386 \u5de6\u6839\u53f3
\nvoid inorder(TreeNode *root) {
\n if (root == NULL) return;
\n inorder(root->left); \/\/ \u5de6\u5b50\u6811
\n printf("%d ", root->val); \/\/ \u8bbf\u95ee\u6839
\n inorder(root->right); \/\/ \u53f3\u5b50\u6811
\n}<\/p>\n
\/\/ \u540e\u5e8f\u904d\u5386 \u5de6\u53f3\u6839
\nvoid postorder(TreeNode *root) {
\n if (root == NULL) return;
\n postorder(root->left); \/\/ \u5de6\u5b50\u6811
\n postorder(root->right); \/\/ \u53f3\u5b50\u6811
\n printf("%d ", root->val); \/\/ \u8bbf\u95ee\u6839
\n} <\/p>\n
\u5df2\u77e5\u4e8c\u53c9\u6811\u524d\u5e8f\u5e8f\u5217\u548c\u4e2d\u5e8f\u5e8f\u5217 \u6c42\u540e\u5e8f\u5e8f\u5217 \u4f8b \u524d\u5e8fABDECF \u4e2d\u5e8fDBEAFC \u6c42\u540e\u5e8f<\/p>\n
\u524d\u5e8f\u5b9a\u6839 \u4e2d\u5e8f\u5206\u5de6\u53f3 \u9012\u5f52\u6c42\u89e3<\/p>\n
\u6b65\u9aa4<\/p>\n
1 \u524d\u5e8f\u7b2c\u4e00\u4e2a\u5143\u7d20\u662f\u6839\u8282\u70b9<\/p>\n
2 \u5728\u4e2d\u5e8f\u4e2d\u627e\u5230\u6839 \u5de6\u8fb9\u662f\u5de6\u5b50\u6811\u4e2d\u5e8f \u53f3\u8fb9\u662f\u53f3\u5b50\u6811\u4e2d\u5e8f<\/p>\n
3 \u6839\u636e\u5de6\u5b50\u6811\u8282\u70b9\u6570 \u5728\u524d\u5e8f\u4e2d\u5212\u5206\u5de6\u5b50\u6811\u524d\u5e8f\u53f3\u5b50\u6811\u524d\u5e8f<\/p>\n
4 \u9012\u5f52\u5904\u7406\u5de6\u5b50\u6811 \u5f97\u5de6\u540e\u5e8f \u9012\u5f52\u5904\u7406\u53f3\u5b50\u6811 \u5f97\u53f3\u540e\u5e8f<\/p>\n
5 \u540e\u5e8f \u5de6\u540e\u5e8f + \u53f3\u540e\u5e8f + \u6839<\/p>\n
#include <stdio.h>
\n#include <string.h>
\n#include <stdlib.h><\/p>\n
\/\/ \u6839\u636e\u524d\u5e8fpre\u548c\u4e2d\u5e8fin \u6c42\u540e\u5e8f \u8fd4\u56de\u540e\u5e8f\u5b57\u7b26\u4e32
\nchar* preInToPost(char *pre, char *in, int len) {
\n if (len <= 0) { \/\/ \u7a7a\u6811
\n char *post = (char*)malloc(1);
\n post[0] = '\\\\0';
\n return post;
\n }<\/p>\n
char root = pre[0]; \/\/ \u524d\u5e8f\u9996\u5143\u7d20\u4e3a\u6839
\n \/\/ \u5728\u4e2d\u5e8f\u4e2d\u627e\u6839\u4f4d\u7f6e
\n int i;
\n for (i = 0; i < len; i++) {
\n if (in[i] == root) break;
\n } \/\/ i\u662f\u6839\u5728\u4e2d\u5e8f\u7684\u4f4d\u7f6e<\/p>\n
int leftLen = i; \/\/ \u5de6\u5b50\u6811\u8282\u70b9\u6570
\n int rightLen = len – i – 1; \/\/ \u53f3\u5b50\u6811\u8282\u70b9\u6570<\/p>\n
\/\/ \u9012\u5f52\u5de6\u5b50\u6811 \u524d\u5e8f[1~leftLen] \u4e2d\u5e8f[0~i-1]
\n char *leftPost = preInToPost(pre + 1, in, leftLen);
\n \/\/ \u9012\u5f52\u53f3\u5b50\u6811 \u524d\u5e8f[1+leftLen~end] \u4e2d\u5e8f[i+1~end]
\n char *rightPost = preInToPost(pre + 1 + leftLen, in + i + 1, rightLen);<\/p>\n
\/\/ \u62fc\u63a5\u540e\u5e8f \u5de6\u540e\u5e8f+\u53f3\u540e\u5e8f+\u6839
\n char *post = (char*)malloc(len + 1);
\n strcpy(post, leftPost);
\n strcat(post, rightPost);
\n post[len – 1] = root; \/\/ \u6839\u653e\u6700\u540e
\n post[len] = '\\\\0';<\/p>\n
free(leftPost); \/\/ \u91ca\u653e\u4e34\u65f6\u5185\u5b58
\n free(rightPost);
\n return post;
\n}<\/p>\n
\/\/ \u793a\u4f8b
\nvoid example() {
\n char pre[] = "ABDECF"; \/\/ \u524d\u5e8f
\n char in[] = "DBEAFC"; \/\/ \u4e2d\u5e8f
\n int len = strlen(pre);
\n char *post = preInToPost(pre, in, len);
\n printf("\u540e\u5e8f\u5e8f\u5217 %s\\\\n", post); \/\/ \u8f93\u51faDEBFCA
\n free(post);
\n} <\/p>\n
\u4e2d\u5e8f\u540e\u5e8f\u6c42\u524d\u5e8f \u601d\u8def\u7c7b\u4f3c \u540e\u5e8f\u672b\u5143\u7d20\u4e3a\u6839 \u4e2d\u5e8f\u5206\u5de6\u53f3 \u9012\u5f52\u6c42\u5de6\u53f3\u524d\u5e8f \u62fc\u63a5\u6839+\u5de6\u524d\u5e8f+\u53f3\u524d\u5e8f<\/p>\n
\u961f\u5217\u6559\u4f1a\u6211\u4eec\u7ebf\u6027\u7ed3\u6784\u7684\u987a\u5e8f\u7ba1\u7406 \u4e8c\u53c9\u6811\u5219\u6253\u5f00\u975e\u7ebf\u6027\u601d\u7ef4\u5927\u95e8 \u524d\u5e8f\u4e2d\u5e8f\u6c42\u540e\u5e8f\u7684\u6838\u5fc3\u662f\u9012\u5f52\u62c6\u5206 \u6293\u4f4f\u6839\u4e0e\u5de6\u53f3\u5b50\u6811\u7684\u5173\u7cfb \u591a\u753b\u56fe\u591a\u7ec3\u624b \u5c31\u80fd\u638c\u63e1\u6811\u7684\u903b\u8f91 \u52a8\u624b\u5b9e\u73b0\u8fd9\u4e9b\u4ee3\u7801 \u4f60\u4f1a\u53d1\u73b0\u6570\u636e\u7ed3\u6784\u5e76\u4e0d\u96be<\/p>\n","protected":false},"excerpt":{"rendered":"
\u8fd9\u7ae0\u8bb2\u89e3\u4e86\u961f\u5217\u7684\u77e5\u8bc6，\u6811\u5f62\u7ed3\u6784\u7684\u57fa\u672c\u6982\u5ff5，\u4ee5\u53ca\u4e8c\u53c9\u6811\u7684\u57fa\u7840\u90e8\u5206\u4ee5\u53ca\u76f8\u5173\u7684\u6982\u5ff5，\u4f8b\u5982\u6839\u636e\u524d\u5e8f\u548c\u4e2d\u5e8f，\u8ba1\u7b97\u540e\u5e8f\u7b49
\n\u4ece\u961f\u5217\u5230\u4e8c\u53c9\u6811 \u6570\u636e\u7ed3\u6784\u5165\u95e8\u6838\u5fc3\u8109\u7edc\u89e3\u6790
\n\u4eca\u5929\u6211\u4eec\u4ece\u4e24\u4e2a\u7ecf\u5178\u6570\u636e\u7ed3\u6784\u5165\u624b \u961f\u5217\u548c\u4e8c\u53c9\u6811 \u4e32\u8054\u8bb2\u89e3\u5b83\u4eec\u7684\u6838\u5fc3\u6982\u5ff5\u4e0e\u5e94\u7528 \u5c24\u5176\u4f1a\u6df1\u5165\u5256\u6790\u4e8c\u53c9\u6811\u4e2d\u524d\u5e8f\u4e2d\u5e8f\u6c42\u540e\u5e8f\u7684\u7ecf\u5178\u95ee\u9898 \u8ba9\u4f60\u5f7b\u5e95\u641e\u61c2\u9012\u5f52\u4e0e\u6811\u7684\u903b\u8f91
\n\u4e00 \u961f\u5217 \u5148\u8fdb\u5148\u51fa\u7684\u7ebf\u6027\u8868
\n1 \u4ec0\u4e48\u662f\u961f\u5217
\n\u961f\u5217\u662f\u4e00\u79cd\u7ebf\u6027\u6570\u636e\u7ed3\u6784 \u7279\u70b9\u662f\u5148\u8fdb\u5148\u51faFIFO \u50cf\u751f\u6d3b\u4e2d\u6392\u961f\u4e70\u7968 <\/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,4617,1813,427,3647],"topic":[],"class_list":["post-70921","post","type-post","status-publish","format-standard","hentry","category-server","tag-c","tag-4617","tag-1813","tag-427","tag-3647"],"yoast_head":"\n