{"id":283,"date":"2026-04-14T00:18:08","date_gmt":"2026-04-13T16:18:08","guid":{"rendered":"https:\/\/edryan.top\/index.php\/2026\/04\/14\/5%e5%a4%a9%e9%80%9f%e6%88%90%e6%95%b0%e6%8d%ae%e7%bb%93%e6%9e%84%e4%b8%8e%e7%ae%97%e6%b3%95-day3\/"},"modified":"2026-04-14T00:18:08","modified_gmt":"2026-04-13T16:18:08","slug":"5%e5%a4%a9%e9%80%9f%e6%88%90%e6%95%b0%e6%8d%ae%e7%bb%93%e6%9e%84%e4%b8%8e%e7%ae%97%e6%b3%95-day3","status":"publish","type":"post","link":"https:\/\/edryan.top\/index.php\/2026\/04\/14\/5%e5%a4%a9%e9%80%9f%e6%88%90%e6%95%b0%e6%8d%ae%e7%bb%93%e6%9e%84%e4%b8%8e%e7%ae%97%e6%b3%95-day3\/","title":{"rendered":"5\u5929\u901f\u6210\u6570\u636e\u7ed3\u6784\u4e0e\u7b97\u6cd5-Day3"},"content":{"rendered":"

5\u5929\u901f\u6210\u6570\u636e\u7ed3\u6784\u4e0e\u7b97\u6cd5-Day3<\/h1>\n

\u7ebf\u6027\u6570\u636e\u7ed3\u6784<\/h2>\n

\u5728\u8ba1\u7b97\u673a\u79d1\u5b66\u4e2d\uff0c\u7ebf\u6027\u6570\u636e\u7ed3\u6784\u662f\u6700\u57fa\u7840\u4e5f\u6700\u91cd\u8981\u7684\u6570\u636e\u7ec4\u7ec7\u65b9\u5f0f\u3002\u4eca\u5929\u6211\u4eec\u5c06\u6df1\u5165\u63a2\u8ba8\u4e09\u79cd\u6838\u5fc3\u7684\u7ebf\u6027\u7ed3\u6784\uff1a\u94fe\u8868<\/strong>\u3001\u6808<\/strong>\u548c\u961f\u5217<\/strong>\u3002\u7406\u89e3\u5b83\u4eec\u7684\u7279\u6027\u3001\u5b9e\u73b0\u65b9\u5f0f\u4e0e\u5e94\u7528\u573a\u666f\uff0c\u662f\u638c\u63e1\u66f4\u590d\u6742\u7b97\u6cd5\u7684\u5fc5\u7ecf\u4e4b\u8def\u3002<\/p>\n

\u94fe\u8868\uff08Linked List\uff09<\/h3>\n

\u4ecb\u7ecd<\/h4>\n

\u94fe\u8868\u662f\u4e00\u79cd\u7269\u7406\u5b58\u50a8\u5355\u5143\u4e0a\u975e\u8fde\u7eed\u3001\u975e\u987a\u5e8f\u7684\u5b58\u50a8\u7ed3\u6784\u3002\u5b83\u901a\u8fc7\u6307\u9488<\/strong>\u5c06\u4e00\u7ec4\u96f6\u6563\u7684\u5185\u5b58\u5757\u4e32\u8054\u8d77\u6765\uff0c\u6bcf\u4e2a\u5185\u5b58\u5757\u79f0\u4e3a\u8282\u70b9\uff08Node\uff09<\/strong>\u3002\u6bcf\u4e2a\u8282\u70b9\u5305\u542b\u4e24\u90e8\u5206\uff1a\u6570\u636e\u57df\u548c\u6307\u9488\u57df\u3002<\/p>\n

\u4e0e\u6570\u7ec4\u76f8\u6bd4\uff0c\u94fe\u8868\u7684\u6700\u5927\u4f18\u52bf\u5728\u4e8e\u63d2\u5165\u548c\u5220\u9664\u64cd\u4f5c\u7684\u65f6\u95f4\u590d\u6742\u5ea6\u4e3aO(1)<\/strong>\uff08\u5728\u5df2\u77e5\u524d\u9a71\u8282\u70b9\u7684\u60c5\u51b5\u4e0b\uff09\uff0c\u4e14\u4e0d\u9700\u8981\u9884\u5148\u5206\u914d\u56fa\u5b9a\u5927\u5c0f\u7684\u5185\u5b58\u7a7a\u95f4\u3002\u4f46\u94fe\u8868\u7684\u7f3a\u70b9\u4e5f\u5f88\u660e\u663e\uff1a\u65e0\u6cd5\u50cf\u6570\u7ec4\u4e00\u6837\u901a\u8fc7\u7d22\u5f15\u968f\u673a\u8bbf\u95ee\u5143\u7d20\uff0c\u67e5\u627e\u7279\u5b9a\u5143\u7d20\u9700\u8981\u4ece\u5934\u904d\u5386\u3002<\/p>\n

\u5e38\u89c1\u94fe\u8868\u7c7b\u578b<\/h4>\n
    \n
  • \u5355\u94fe\u8868<\/strong>\uff1a\u6bcf\u4e2a\u8282\u70b9\u53ea\u5305\u542b\u4e00\u4e2a\u6307\u5411\u540e\u7ee7\u8282\u70b9\u7684\u6307\u9488<\/li>\n
  • \u53cc\u94fe\u8868<\/strong>\uff1a\u6bcf\u4e2a\u8282\u70b9\u5305\u542b\u524d\u9a71\u548c\u540e\u7ee7\u4e24\u4e2a\u6307\u9488\uff0c\u652f\u6301\u53cc\u5411\u904d\u5386<\/li>\n
  • \u5faa\u73af\u94fe\u8868<\/strong>\uff1a\u5c3e\u8282\u70b9\u7684\u6307\u9488\u6307\u5411\u5934\u8282\u70b9\uff0c\u5f62\u6210\u73af\u72b6\u7ed3\u6784<\/li>\n<\/ul>\n

    \u5355\u94fe\u8868\u57fa\u7840\u5b9e\u73b0<\/h4>\n
    #include <iostream>\nusing namespace std;\n\n\/\/ \u5b9a\u4e49\u94fe\u8868\u8282\u70b9\nstruct ListNode {\n    int val;\n    ListNode* next;\n    ListNode(int x) : val(x), next(nullptr) {}\n};\n\n\/\/ \u5728\u94fe\u8868\u5934\u90e8\u63d2\u5165\u8282\u70b9\nvoid insertAtHead(ListNode*& head, int val) {\n    ListNode* newNode = new ListNode(val);\n    newNode->next = head;\n    head = newNode;\n}\n\n\/\/ \u5220\u9664\u6307\u5b9a\u503c\u7684\u8282\u70b9\nvoid deleteNode(ListNode*& head, int val) {\n    if (!head) return;\n    \n    if (head->val == val) {\n        ListNode* temp = head;\n        head = head->next;\n        delete temp;\n        return;\n    }\n    \n    ListNode* cur = head;\n    while (cur->next && cur->next->val != val) {\n        cur = cur->next;\n    }\n    \n    if (cur->next) {\n        ListNode* temp = cur->next;\n        cur->next = cur->next->next;\n        delete temp;\n    }\n}\n\n\/\/ \u6253\u5370\u94fe\u8868\nvoid printList(ListNode* head) {\n    while (head) {\n        cout << head->val << \" -> \";\n        head = head->next;\n    }\n    cout << \"nullptr\" << endl;\n}\n\nint main() {\n    ListNode* head = nullptr;\n    \n    insertAtHead(head, 3);\n    insertAtHead(head, 2);\n    insertAtHead(head, 1);\n    \n    cout << \"\u521d\u59cb\u94fe\u8868: \";\n    printList(head);\n    \n    deleteNode(head, 2);\n    cout << \"\u5220\u9664\u8282\u70b92\u540e: \";\n    printList(head);\n    \n    return 0;\n}\n<\/code><\/pre>\n
    \u94fe\u8868\u7ecf\u5178\u6280\u5de7\uff1a\u5feb\u6162\u6307\u9488<\/h4>\n
    \u5feb\u6162\u6307\u9488\u662f\u89e3\u51b3\u94fe\u8868\u95ee\u9898\u7684\u5229\u5668\u3002\u5feb\u6307\u9488\u6bcf\u6b21\u8d70\u4e24\u6b65\uff0c\u6162\u6307\u9488\u6bcf\u6b21\u8d70\u4e00\u6b65\uff1a<\/p>\n
      \n
    • \u627e\u4e2d\u70b9<\/strong>\uff1a\u5f53\u5feb\u6307\u9488\u5230\u8fbe\u672b\u5c3e\u65f6\uff0c\u6162\u6307\u9488\u6b63\u597d\u5728\u94fe\u8868\u4e2d\u95f4<\/li>\n
    • \u5224\u73af<\/strong>\uff1a\u5982\u679c\u94fe\u8868\u6709\u73af\uff0c\u5feb\u6162\u6307\u9488\u5fc5\u5b9a\u76f8\u9047<\/li>\n
    • \u627e\u5012\u6570\u7b2cK\u4e2a\u8282\u70b9<\/strong>\uff1a\u5feb\u6307\u9488\u5148\u8d70K\u6b65\uff0c\u7136\u540e\u5feb\u6162\u6307\u9488\u540c\u6b65\u524d\u8fdb<\/li>\n<\/ul>\n
      \u6808\uff08Stack\uff09<\/h3>\n
      \u4ecb\u7ecd<\/h4>\n
      \u6808\u662f\u4e00\u79cd\u540e\u8fdb\u5148\u51fa\uff08LIFO, Last In First Out\uff09<\/strong>\u7684\u7ebf\u6027\u6570\u636e\u7ed3\u6784\u3002\u5b83\u53ea\u5141\u8bb8\u5728\u4e00\u7aef\uff08\u79f0\u4e3a\u6808\u9876\uff09\u8fdb\u884c\u63d2\u5165\u548c\u5220\u9664\u64cd\u4f5c\u3002\u751f\u6d3b\u4e2d\u6808\u7684\u4f8b\u5b50\u6bd4\u6bd4\u7686\u662f\uff1a\u4e00\u53e0\u76d8\u5b50\u3001\u6d4f\u89c8\u5668\u7684\u540e\u9000\u6309\u94ae\u3001\u51fd\u6570\u8c03\u7528\u7684\u5185\u5b58\u6a21\u578b\u3002<\/p>\n
      \u6838\u5fc3\u64cd\u4f5c<\/h4>\n
        \n
      • push<\/strong>\uff1a\u5c06\u5143\u7d20\u538b\u5165\u6808\u9876<\/li>\n
      • pop<\/strong>\uff1a\u5c06\u6808\u9876\u5143\u7d20\u5f39\u51fa<\/li>\n
      • top\/peek<\/strong>\uff1a\u67e5\u770b\u6808\u9876\u5143\u7d20\uff0c\u4f46\u4e0d\u5f39\u51fa<\/li>\n
      • isEmpty<\/strong>\uff1a\u5224\u65ad\u6808\u662f\u5426\u4e3a\u7a7a<\/li>\n<\/ul>\n
        \u57fa\u4e8e\u6570\u7ec4\u7684\u6808\u5b9e\u73b0<\/h4>\n
        #include <iostream>\n#include <vector>\nusing namespace std;\n\nclass Stack {\nprivate:\n    vector<int> data;\n\npublic:\n    void push(int x) {\n        data.push_back(x);\n    }\n    \n    int pop() {\n        if (isEmpty()) {\n            throw runtime_error(\"Stack is empty\");\n        }\n        int topVal = data.back();\n        data.pop_back();\n        return topVal;\n    }\n    \n    int top() {\n        if (isEmpty()) {\n            throw runtime_error(\"Stack is empty\");\n        }\n        return data.back();\n    }\n    \n    bool isEmpty() {\n        return data.empty();\n    }\n    \n    int size() {\n        return data.size();\n    }\n};\n\nint main() {\n    Stack s;\n    s.push(10);\n    s.push(20);\n    s.push(30);\n    \n    cout << \"\u6808\u9876\u5143\u7d20: \" << s.top() << endl;\n    cout << \"\u5f39\u51fa: \" << s.pop() << endl;\n    cout << \"\u5f53\u524d\u5927\u5c0f: \" << s.size() << endl;\n    \n    return 0;\n}\n<\/code><\/pre>\n
        \u6808\u7684\u7ecf\u5178\u5e94\u7528\uff1a\u62ec\u53f7\u5339\u914d<\/h4>\n
        \u7ed9\u5b9a\u4e00\u4e2a\u53ea\u5305\u542b\u62ec\u53f7\u7684\u5b57\u7b26\u4e32\uff0c\u5224\u65ad\u5176\u662f\u5426\u5408\u6cd5\u3002\u57fa\u672c\u601d\u8def\uff1a\u9047\u5230\u5de6\u62ec\u53f7\u5c31\u5165\u6808\uff0c\u9047\u5230\u53f3\u62ec\u53f7\u5c31\u4e0e\u6808\u9876\u5339\u914d\uff0c\u82e5\u5339\u914d\u6210\u529f\u5219\u51fa\u6808\uff0c\u6700\u540e\u6808\u4e3a\u7a7a\u5219\u5408\u6cd5\u3002<\/p>\n
        bool isValid(string s) {\n    vector<char> stack;\n    for (char c : s) {\n        if (c == '(' || c == '[' || c == '{') {\n            stack.push_back(c);\n        } else {\n            if (stack.empty()) return false;\n            char top = stack.back();\n            if ((c == ')' && top == '(') ||\n                (c == ']' && top == '[') ||\n                (c == '}' && top == '{')) {\n                stack.pop_back();\n            } else {\n                return false;\n            }\n        }\n    }\n    return stack.empty();\n}\n<\/code><\/pre>\n
        \u961f\u5217\uff08Queue\uff09<\/h3>\n
        \u4ecb\u7ecd<\/h4>\n
        \u961f\u5217\u662f\u4e00\u79cd\u5148\u8fdb\u5148\u51fa\uff08FIFO, First In First Out\uff09<\/strong>\u7684\u7ebf\u6027\u6570\u636e\u7ed3\u6784\u3002\u5b83\u53ea\u5141\u8bb8\u5728\u4e00\u7aef\uff08\u961f\u5c3e\uff09\u63d2\u5165\u5143\u7d20\uff0c\u5728\u53e6\u4e00\u7aef\uff08\u961f\u5934\uff09\u5220\u9664\u5143\u7d20\u3002\u751f\u6d3b\u4e2d\u7684\u6392\u961f\u4e70\u7968\u3001\u6253\u5370\u4efb\u52a1\u8c03\u5ea6\u3001CPU\u8fdb\u7a0b\u8c03\u5ea6\u90fd\u662f\u961f\u5217\u7684\u5178\u578b\u5e94\u7528\u3002<\/p>\n
        \u6838\u5fc3\u64cd\u4f5c<\/h4>\n
          \n
        • enqueue<\/strong>\uff1a\u5728\u961f\u5c3e\u63d2\u5165\u5143\u7d20<\/li>\n
        • dequeue<\/strong>\uff1a\u4ece\u961f\u5934\u79fb\u9664\u5143\u7d20<\/li>\n
        • front<\/strong>\uff1a\u67e5\u770b\u961f\u5934\u5143\u7d20<\/li>\n
        • isEmpty<\/strong>\uff1a\u5224\u65ad\u961f\u5217\u662f\u5426\u4e3a\u7a7a<\/li>\n<\/ul>\n
          \u57fa\u4e8e\u6570\u7ec4\u7684\u5faa\u73af\u961f\u5217\u5b9e\u73b0<\/h4>\n
          #include <iostream>\nusing namespace std;\n\nclass CircularQueue {\nprivate:\n    int* data;\n    int front, rear;\n    int capacity;\n    int count;\n\npublic:\n    CircularQueue(int k) {\n        capacity = k;\n        data = new int[k];\n        front = 0;\n        rear = -1;\n        count = 0;\n    }\n    \n    bool enqueue(int value) {\n        if (count == capacity) return false;\n        rear = (rear + 1) % capacity;\n        data[rear] = value;\n        count++;\n        return true;\n    }\n    \n    bool dequeue() {\n        if (count == 0) return false;\n        front = (front + 1) % capacity;\n        count--;\n        return true;\n    }\n    \n    int Front() {\n        if (count == 0) return -1;\n        return data[front];\n    }\n    \n    int Rear() {\n        if (count == 0) return -1;\n        return data[rear];\n    }\n    \n    bool isEmpty() {\n        return count == 0;\n    }\n    \n    bool isFull() {\n        return count == capacity;\n    }\n};\n\nint main() {\n    CircularQueue q(3);\n    q.enqueue(1);\n    q.enqueue(2);\n    q.enqueue(3);\n    \n    cout << \"\u961f\u5934: \" << q.Front() << endl;\n    q.dequeue();\n    q.enqueue(4);\n    cout << \"\u961f\u5c3e: \" << q.Rear() << endl;\n    \n    return 0;\n}\n<\/code><\/pre>\n
          \u961f\u5217\u7684\u7ecf\u5178\u5e94\u7528\uff1aBFS\u7684\u5e95\u5c42\u652f\u6491<\/h4>\n
          \u5728Day2\u4e2d\uff0c\u6211\u4eec\u5b66\u4e60\u4e86\u5e7f\u5ea6\u4f18\u5148\u641c\u7d22\uff08BFS\uff09\u3002BFS\u4e4b\u6240\u4ee5\u80fd\u591f\u5c42\u5c42\u63a8\u8fdb<\/strong>\uff0c\u6b63\u662f\u56e0\u4e3a\u5b83\u4f7f\u7528\u4e86\u961f\u5217\u6765\u5b58\u50a8\u5f85\u8bbf\u95ee\u7684\u8282\u70b9\u3002\u6bcf\u6b21\u4ece\u961f\u5934\u53d6\u51fa\u4e00\u4e2a\u8282\u70b9\u8bbf\u95ee\uff0c\u540c\u65f6\u5c06\u5176\u672a\u8bbf\u95ee\u7684\u90bb\u5c45\u52a0\u5165\u961f\u5c3e\uff0c\u4fdd\u8bc1\u4e86\u8ddd\u79bb\u8d77\u70b9\u8fd1\u7684\u8282\u70b9\u4f18\u5148\u88ab\u5904\u7406\u3002<\/p>\n
          \u4e09\u79cd\u7ed3\u6784\u7684\u5bf9\u6bd4\u603b\u7ed3<\/h2>\n\n\n\n\n\n\n\n\n\n
          \u7279\u6027<\/th>\n\u6570\u7ec4<\/th>\n\u94fe\u8868<\/th>\n\u6808<\/th>\n\u961f\u5217<\/th>\n<\/tr>\n<\/thead>\n
          \u8bbf\u95ee\u65b9\u5f0f<\/td>\n\u968f\u673a\u8bbf\u95ee<\/td>\n\u987a\u5e8f\u8bbf\u95ee<\/td>\n\u53ea\u80fd\u8bbf\u95ee\u6808\u9876<\/td>\n\u53ea\u80fd\u8bbf\u95ee\u961f\u5934<\/td>\n<\/tr>\n
          \u63d2\u5165\/\u5220\u9664<\/td>\nO(n)<\/td>\nO(1)<\/td>\nO(1)<\/td>\nO(1)<\/td>\n<\/tr>\n
          \u67e5\u627e<\/td>\nO(1)\u6309\u7d22\u5f15<\/td>\nO(n)<\/td>\nO(n)<\/td>\nO(n)<\/td>\n<\/tr>\n
          \u5185\u5b58\u5206\u914d<\/td>\n\u8fde\u7eed<\/td>\n\u79bb\u6563<\/td>\n\u8fde\u7eed\/\u79bb\u6563<\/td>\n\u8fde\u7eed\/\u79bb\u6563<\/td>\n<\/tr>\n
          \u5178\u578b\u5e94\u7528<\/td>\n\u7d22\u5f15\u67e5\u8be2<\/td>\n\u9891\u7e41\u589e\u5220<\/td>\n\u56de\u6eaf\u3001\u9012\u5f52<\/td>\nBFS\u3001\u8c03\u5ea6<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
          \u7ed3\u8bed<\/h2>\n
          \u94fe\u8868\u3001\u6808\u548c\u961f\u5217\u662f\u6784\u5efa\u66f4\u590d\u6742\u6570\u636e\u7ed3\u6784\u4e0e\u7b97\u6cd5\u7684\u57fa\u77f3\u3002\u94fe\u8868\u8ba9\u6211\u4eec\u6446\u8131\u4e86\u8fde\u7eed\u5185\u5b58\u7684\u675f\u7f1a\uff1b\u6808\u7684LIFO\u7279\u6027\u5b8c\u7f8e\u9002\u914d\u4e86\u9012\u5f52\u548c\u56de\u6eaf\u95ee\u9898\uff1b\u961f\u5217\u7684FIFO\u7279\u6027\u5219\u662f\u5c42\u7ea7\u904d\u5386\u548c\u4efb\u52a1\u8c03\u5ea6\u7684\u6838\u5fc3\u652f\u6491\u3002\u638c\u63e1\u5b83\u4eec\uff0c\u4f60\u5c31\u4e3a\u540e\u7eed\u5b66\u4e60\u6811\u3001\u56fe\u3001\u54c8\u5e0c\u8868\u7b49\u9ad8\u7ea7\u7ed3\u6784\u6253\u4e0b\u4e86\u575a\u5b9e\u7684\u57fa\u7840\u3002<\/p>\n
          \u4e0b\u4e00\u7bc7\u9884\u544a\uff1a5\u5929\u901f\u6210\u6570\u636e\u7ed3\u6784\u4e0e\u7b97\u6cd5-Day4\u2014\u2014\u6811\u4e0e\u4e8c\u53c9\u6811\u3002<\/strong><\/p>\n","protected":false},"excerpt":{"rendered":"
          5\u5929\u901f\u6210\u6570\u636e\u7ed3\u6784\u4e0e\u7b97\u6cd5-Day3 \u7ebf\u6027\u6570\u636e\u7ed3\u6784 \u5728\u8ba1\u7b97\u673a\u79d1\u5b66\u4e2d\uff0c\u7ebf\u6027\u6570\u636e\u7ed3\u6784\u662f\u6700\u57fa\u7840\u4e5f\u6700\u91cd\u8981\u7684\u6570\u636e\u7ec4\u7ec7\u65b9\u5f0f\u3002\u4eca […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"advanced_seo_description":"","jetpack_seo_html_title":"","jetpack_seo_noindex":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[14,15],"tags":[],"class_list":["post-283","post","type-post","status-publish","format-standard","hentry","category-14","category-15"],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/edryan.top\/index.php\/wp-json\/wp\/v2\/posts\/283","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/edryan.top\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/edryan.top\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/edryan.top\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/edryan.top\/index.php\/wp-json\/wp\/v2\/comments?post=283"}],"version-history":[{"count":0,"href":"https:\/\/edryan.top\/index.php\/wp-json\/wp\/v2\/posts\/283\/revisions"}],"wp:attachment":[{"href":"https:\/\/edryan.top\/index.php\/wp-json\/wp\/v2\/media?parent=283"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/edryan.top\/index.php\/wp-json\/wp\/v2\/categories?post=283"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/edryan.top\/index.php\/wp-json\/wp\/v2\/tags?post=283"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}