{"id":485,"date":"2025-04-03T08:29:34","date_gmt":"2025-04-03T08:29:34","guid":{"rendered":"https:\/\/news.techjunior.vn\/?p=485"},"modified":"2025-04-03T08:29:34","modified_gmt":"2025-04-03T08:29:34","slug":"%f0%9f%94%a5-danh-sach-lien-ket-trong-c-huong-dan-toan-dien-tu-co-ban-den-nang-cao-%f0%9f%94%a5","status":"publish","type":"post","link":"https:\/\/news.techjunior.vn\/?p=485","title":{"rendered":"\ud83d\udd25 Danh S\u00e1ch Li\u00ean K\u1ebft Trong C \u2013 H\u01b0\u1edbng D\u1eabn To\u00e0n Di\u1ec7n T\u1eeb C\u01a1 B\u1ea3n \u0110\u1ebfn N\u00e2ng Cao! \ud83d\udd25"},"content":{"rendered":"
\n
\"\"<\/figure>\n<\/div>\n\n\n
\n\n\n\n

B\u1ea1n \u0111\u00e3 bao gi\u1edd g\u1eb7p tr\u01b0\u1eddng h\u1ee3p kh\u00f4ng bi\u1ebft tr\u01b0\u1edbc s\u1ed1 l\u01b0\u1ee3ng ph\u1ea7n t\u1eed<\/strong> c\u1ea7n l\u01b0u tr\u1eef trong ch\u01b0\u01a1ng tr\u00ecnh C ch\u01b0a? Ho\u1eb7c b\u1ea1n mu\u1ed1n th\u00eam, x\u00f3a ph\u1ea7n t\u1eed m\u00e0 kh\u00f4ng c\u1ea7n d\u1ecbch chuy\u1ec3n d\u1eef li\u1ec7u trong m\u1ea3ng<\/strong>?<\/p>\n\n\n\n

\ud83d\udca1 Danh s\u00e1ch li\u00ean k\u1ebft (Linked List)<\/strong> ch\u00ednh l\u00e0 gi\u1ea3i ph\u00e1p ho\u00e0n h\u1ea3o!<\/p>\n\n\n\n

Trong b\u00e0i vi\u1ebft n\u00e0y, ch\u00fang ta s\u1ebd \u0111i s\u00e2u v\u00e0o danh s\u00e1ch li\u00ean k\u1ebft trong C, t\u1eeb kh\u00e1i ni\u1ec7m \u0111\u1ebfn c\u00e1ch s\u1eed d\u1ee5ng, \u01b0u nh\u01b0\u1ee3c \u0111i\u1ec3m, c\u00e1c lo\u1ea1i danh s\u00e1ch li\u00ean k\u1ebft v\u00e0 nhi\u1ec1u v\u00ed d\u1ee5 th\u1ef1c t\u1ebf gi\u00fap b\u1ea1n hi\u1ec3u s\u00e2u \u2013 l\u00e0m ch\u1ee7<\/strong> n\u00f3! \ud83d\ude80<\/p>\n\n\n\n

\n\n\n\n

\ud83d\udccc 1. Danh s\u00e1ch li\u00ean k\u1ebft l\u00e0 g\u00ec?<\/strong><\/h2>\n\n\n\n

\ud83d\udd39 \u0110\u1ecbnh ngh\u0129a<\/strong><\/h3>\n\n\n\n

Danh s\u00e1ch li\u00ean k\u1ebft (Linked List) l\u00e0 m\u1ed9t c\u1ea5u tr\u00fac d\u1eef li\u1ec7u \u0111\u1ed9ng<\/strong>, g\u1ed3m nhi\u1ec1u n\u00fat (node)<\/strong> li\u00ean k\u1ebft v\u1edbi nhau b\u1eb1ng con tr\u1ecf<\/strong>.<\/p>\n\n\n\n

\ud83d\udca1 Gi\u1ea3i th\u00edch:<\/strong><\/p>\n\n\n\n

    \n
  • N\u00fat (Node)<\/strong> trong danh s\u00e1ch li\u00ean k\u1ebft c\u00f3 th\u1ec3 ch\u1ee9a m\u1ed9t ph\u1ea7n t\u1eed d\u1eef li\u1ec7u v\u00e0 m\u1ed9t con tr\u1ecf tr\u1ecf \u0111\u1ebfn n\u00fat ti\u1ebfp theo.<\/li>\n\n\n\n
  • Danh s\u00e1ch li\u00ean k\u1ebft c\u00f3 th\u1ec3 \u0111\u01b0\u1ee3c khai b\u00e1o v\u00e0 s\u1eed d\u1ee5ng linh ho\u1ea1t, kh\u00f4ng c\u1ea7n bi\u1ebft tr\u01b0\u1edbc k\u00edch th\u01b0\u1edbc danh s\u00e1ch.<\/li>\n<\/ul>\n\n\n\n

    M\u1ed7i n\u00fat<\/strong> ch\u1ee9a hai ph\u1ea7n:<\/p>\n\n\n\n

      \n
    • D\u1eef li\u1ec7u (data):<\/strong> Gi\u00e1 tr\u1ecb c\u1ee7a ph\u1ea7n t\u1eed trong danh s\u00e1ch.<\/li>\n\n\n\n
    • Con tr\u1ecf (pointer):<\/strong> Tr\u1ecf \u0111\u1ebfn n\u00fat ti\u1ebfp theo trong danh s\u00e1ch.<\/li>\n<\/ul>\n\n\n\n

      \ud83d\udd39 So s\u00e1nh Danh s\u00e1ch li\u00ean k\u1ebft v\u00e0 M\u1ea3ng<\/strong><\/h3>\n\n\n\n
      T\u00ednh n\u0103ng<\/th>M\u1ea3ng<\/th>Danh s\u00e1ch li\u00ean k\u1ebft<\/th><\/tr><\/thead>
      K\u00edch th\u01b0\u1edbc<\/td>C\u1ed1 \u0111\u1ecbnh<\/td>Linh ho\u1ea1t<\/td><\/tr>
      Truy xu\u1ea5t ph\u1ea7n t\u1eed<\/td>Nhanh (O(1))<\/td>Ch\u1eadm (O(n))<\/td><\/tr>
      Ch\u00e8n\/X\u00f3a ph\u1ea7n t\u1eed<\/td>T\u1ed1n chi ph\u00ed (O(n))<\/td>Nhanh h\u01a1n (O(1) – n\u1ebfu c\u00f3 con tr\u1ecf)<\/td><\/tr>
      D\u00f9ng b\u1ed9 nh\u1edb<\/td>C\u00f3 th\u1ec3 l\u00e3ng ph\u00ed<\/td>T\u1ed1i \u01b0u h\u01a1n<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

      \ud83d\udca1 Gi\u1ea3i th\u00edch:<\/strong><\/p>\n\n\n\n

        \n
      • M\u1ea3ng<\/strong> c\u00f3 k\u00edch th\u01b0\u1edbc c\u1ed1 \u0111\u1ecbnh, trong khi danh s\u00e1ch li\u00ean k\u1ebft<\/strong> cho ph\u00e9p m\u1edf r\u1ed9ng linh ho\u1ea1t m\u00e0 kh\u00f4ng ph\u1ea3i d\u1ecbch chuy\u1ec3n d\u1eef li\u1ec7u.<\/li>\n\n\n\n
      • M\u1ea3ng h\u1ed7 tr\u1ee3 truy xu\u1ea5t nhanh<\/strong> qua ch\u1ec9 s\u1ed1, trong khi danh s\u00e1ch li\u00ean k\u1ebft ph\u1ea3i duy\u1ec7t t\u1eebng ph\u1ea7n t\u1eed.<\/li>\n<\/ul>\n\n\n\n
        \n\n\n\n

        \ud83d\udd25 2. C\u00e1c lo\u1ea1i danh s\u00e1ch li\u00ean k\u1ebft trong C<\/strong><\/h2>\n\n\n\n

        C\u00f3 nhi\u1ec1u lo\u1ea1i danh s\u00e1ch li\u00ean k\u1ebft, t\u00f9y v\u00e0o c\u00e1ch ch\u00fang ta li\u00ean k\u1ebft c\u00e1c ph\u1ea7n t\u1eed:<\/p>\n\n\n\n

        \ud83d\udd39 Danh s\u00e1ch li\u00ean k\u1ebft \u0111\u01a1n (Singly Linked List)<\/strong><\/h3>\n\n\n\n
          \n
        • M\u1ed7i n\u00fat ch\u1ec9 ch\u1ee9a m\u1ed9t con tr\u1ecf<\/strong> tr\u1ecf \u0111\u1ebfn n\u00fat k\u1ebf ti\u1ebfp.<\/li>\n\n\n\n
        • Duy\u1ec7t danh s\u00e1ch t\u1eeb \u0111\u1ea7u \u0111\u1ebfn cu\u1ed1i<\/strong>.<\/li>\n<\/ul>\n\n\n\n

          \ud83d\udca1 Gi\u1ea3i th\u00edch:<\/strong>
          Danh s\u00e1ch li\u00ean k\u1ebft \u0111\u01a1n l\u00e0 d\u1ea1ng c\u01a1 b\u1ea3n nh\u1ea5t c\u1ee7a danh s\u00e1ch li\u00ean k\u1ebft. M\u1ed7i n\u00fat ch\u1ec9 tr\u1ecf \u0111\u1ebfn ph\u1ea7n t\u1eed k\u1ebf ti\u1ebfp, \u0111i\u1ec1u n\u00e0y gi\u00fap \u0111\u01a1n gi\u1ea3n h\u00f3a vi\u1ec7c thao t\u00e1c nh\u01b0ng l\u1ea1i c\u00f3 nh\u01b0\u1ee3c \u0111i\u1ec3m khi c\u1ea7n duy\u1ec7t ng\u01b0\u1ee3c ho\u1eb7c x\u00f3a ph\u1ea7n t\u1eed gi\u1eefa danh s\u00e1ch.<\/p>\n\n\n\n

          \ud83d\udc49 C\u1ea5u tr\u00fac m\u1ed9t n\u00fat:<\/strong><\/p>\n\n\n\n

          struct Node {\n    int data;         \/\/ D\u1eef li\u1ec7u c\u1ee7a n\u00fat\n    struct Node *next; \/\/ Con tr\u1ecf tr\u1ecf \u0111\u1ebfn n\u00fat k\u1ebf ti\u1ebfp\n};\n<\/code><\/pre>\n\n\n\n
          \ud83d\udc49 V\u00ed d\u1ee5:<\/strong><\/p>\n\n\n\n
          struct Node *head = NULL; \/\/ Khai b\u00e1o danh s\u00e1ch r\u1ed7ng\n<\/code><\/pre>\n\n\n\n
          \n\n\n\n
          \ud83d\udd39 Danh s\u00e1ch li\u00ean k\u1ebft \u0111\u00f4i (Doubly Linked List)<\/strong><\/h3>\n\n\n\n
            \n
          • M\u1ed7i n\u00fat ch\u1ee9a hai con tr\u1ecf<\/strong>:\n
              \n
            • next<\/strong> tr\u1ecf \u0111\u1ebfn n\u00fat k\u1ebf ti\u1ebfp.<\/li>\n\n\n\n
            • prev<\/strong> tr\u1ecf \u0111\u1ebfn n\u00fat tr\u01b0\u1edbc \u0111\u00f3.<\/li>\n<\/ul>\n<\/li>\n\n\n\n
            • Duy\u1ec7t danh s\u00e1ch c\u1ea3 hai chi\u1ec1u<\/strong>.<\/li>\n<\/ul>\n\n\n\n
              \ud83d\udca1 Gi\u1ea3i th\u00edch:<\/strong>
              Danh s\u00e1ch li\u00ean k\u1ebft \u0111\u00f4i cho ph\u00e9p b\u1ea1n duy\u1ec7t qua danh s\u00e1ch t\u1eeb c\u1ea3 hai chi\u1ec1u<\/strong> (t\u1eeb \u0111\u1ea7u \u0111\u1ebfn cu\u1ed1i v\u00e0 ng\u01b0\u1ee3c l\u1ea1i). \u0110i\u1ec1u n\u00e0y gi\u00fap thao t\u00e1c x\u00f3a ph\u1ea7n t\u1eed gi\u1eefa danh s\u00e1ch<\/strong> d\u1ec5 d\u00e0ng h\u01a1n.<\/p>\n\n\n\n
              \ud83d\udc49 C\u1ea5u tr\u00fac m\u1ed9t n\u00fat:<\/strong><\/p>\n\n\n\n
              struct Node {\n    int data;          \/\/ D\u1eef li\u1ec7u c\u1ee7a n\u00fat\n    struct Node *next;  \/\/ Con tr\u1ecf tr\u1ecf \u0111\u1ebfn n\u00fat k\u1ebf ti\u1ebfp\n    struct Node *prev;  \/\/ Con tr\u1ecf tr\u1ecf \u0111\u1ebfn n\u00fat tr\u01b0\u1edbc \u0111\u00f3\n};\n<\/code><\/pre>\n\n\n\n
              \ud83d\udc49 \u01afu \u0111i\u1ec3m:<\/strong>
              D\u1ec5 d\u00e0ng duy\u1ec7t ng\u01b0\u1ee3c v\u00e0 x\u00f3a ph\u1ea7n t\u1eed gi\u1eefa danh s\u00e1ch.<\/p>\n\n\n\n
              \n\n\n\n
              \ud83d\udd39 Danh s\u00e1ch li\u00ean k\u1ebft v\u00f2ng (Circular Linked List)<\/strong><\/h3>\n\n\n\n
                \n
              • N\u00fat cu\u1ed1i c\u00f9ng tr\u1ecf ng\u01b0\u1ee3c l\u1ea1i n\u00fat \u0111\u1ea7u ti\u00ean<\/strong> thay v\u00ec NULL.<\/li>\n\n\n\n
              • Gi\u00fap l\u1eb7p v\u00f2ng v\u00f4 h\u1ea1n<\/strong>, h\u1eefu \u00edch trong h\u1ec7 \u0111i\u1ec1u h\u00e0nh, b\u1ed9 l\u1eadp l\u1ecbch\u2026<\/li>\n<\/ul>\n\n\n\n
                \ud83d\udca1 Gi\u1ea3i th\u00edch:<\/strong>
                Danh s\u00e1ch li\u00ean k\u1ebft v\u00f2ng gi\u00fap duy tr\u00ec li\u00ean k\u1ebft v\u00f2ng l\u1eb7p v\u00f4 h\u1ea1n, h\u1eefu \u00edch cho c\u00e1c t\u00e1c v\u1ee5 l\u1eb7p l\u1ea1i li\u00ean t\u1ee5c<\/strong>, v\u00ed d\u1ee5 nh\u01b0 trong l\u1ecbch tr\u00ecnh c\u1ee7a h\u1ec7 \u0111i\u1ec1u h\u00e0nh.<\/p>\n\n\n\n
                \ud83d\udc49 V\u00ed d\u1ee5:<\/strong><\/p>\n\n\n\n
                head->next->next->next = head; \/\/ Li\u00ean k\u1ebft v\u00f2ng\n<\/code><\/pre>\n\n\n\n
                \n\n\n\n
                \ud83c\udfaf 3. C\u00e1c thao t\u00e1c tr\u00ean danh s\u00e1ch li\u00ean k\u1ebft<\/strong><\/h2>\n\n\n\n
                \u2705 Th\u00eam ph\u1ea7n t\u1eed v\u00e0o \u0111\u1ea7u danh s\u00e1ch<\/strong><\/h3>\n\n\n\n
                void insertAtHead(struct Node **head, int value) {\n    struct Node *newNode = (struct Node*)malloc(sizeof(struct Node));\n    newNode->data = value;\n    newNode->next = *head;\n    *head = newNode;\n}\n<\/code><\/pre>\n\n\n\n
                \ud83d\udca1 Gi\u1ea3i th\u00edch:<\/strong><\/p>\n\n\n\n
                  \n
                • C\u1ea5p ph\u00e1t b\u1ed9 nh\u1edb cho n\u00fat m\u1edbi, g\u00e1n gi\u00e1 tr\u1ecb v\u00e0 tr\u1ecf con tr\u1ecf next<\/strong> c\u1ee7a n\u00f3 \u0111\u1ebfn n\u00fat \u0111\u1ea7u ti\u00ean hi\u1ec7n t\u1ea1i<\/strong>.<\/li>\n\n\n\n
                • Sau \u0111\u00f3, head<\/strong> \u0111\u01b0\u1ee3c c\u1eadp nh\u1eadt \u0111\u1ec3 tr\u1ecf \u0111\u1ebfn n\u00fat m\u1edbi.<\/li>\n<\/ul>\n\n\n\n
                  \n\n\n\n
                  \u2705 Th\u00eam ph\u1ea7n t\u1eed v\u00e0o cu\u1ed1i danh s\u00e1ch<\/strong><\/h3>\n\n\n\n
                  void insertAtTail(struct Node **head, int value) {\n    struct Node *newNode = (struct Node*)malloc(sizeof(struct Node));\n    newNode->data = value;\n    newNode->next = NULL;\n\n    if (*head == NULL) {\n        *head = newNode;\n        return;\n    }\n\n    struct Node *temp = *head;\n    while (temp->next != NULL) {\n        temp = temp->next;\n    }\n    temp->next = newNode;\n}\n<\/code><\/pre>\n\n\n\n
                  \ud83d\udca1 Gi\u1ea3i th\u00edch:<\/strong><\/p>\n\n\n\n
                    \n
                  • N\u1ebfu danh s\u00e1ch r\u1ed7ng, g\u00e1n newNode<\/strong> l\u00e0m head<\/strong>.<\/li>\n\n\n\n
                  • N\u1ebfu kh\u00f4ng, duy\u1ec7t \u0111\u1ebfn n\u00fat cu\u1ed1i c\u00f9ng<\/strong> v\u00e0 g\u00e1n next<\/strong> c\u1ee7a n\u00f3 b\u1eb1ng newNode<\/strong>.<\/li>\n<\/ul>\n\n\n\n
                    \n\n\n\n
                    \u2705 X\u00f3a ph\u1ea7n t\u1eed \u0111\u1ea7u ti\u00ean c\u1ee7a danh s\u00e1ch<\/strong><\/h3>\n\n\n\n
                    void deleteAtHead(struct Node **head) {\n    if (*head == NULL) return;\n\n    struct Node *temp = *head;\n    *head = (*head)->next;\n    free(temp);\n}\n<\/code><\/pre>\n\n\n\n
                    \ud83d\udca1 Gi\u1ea3i th\u00edch:<\/strong><\/p>\n\n\n\n
                      \n
                    • L\u01b0u tr\u1eef n\u00fat \u0111\u1ea7u ti\u00ean<\/strong> v\u00e0o temp<\/strong>, sau \u0111\u00f3 c\u1eadp nh\u1eadt head<\/strong> tr\u1ecf \u0111\u1ebfn n\u00fat ti\u1ebfp theo<\/strong>.<\/li>\n\n\n\n
                    • Gi\u1ea3i ph\u00f3ng b\u1ed9 nh\u1edb c\u1ee7a n\u00fat \u0111\u1ea7u ti\u00ean<\/strong>.<\/li>\n<\/ul>\n\n\n\n
                      \n\n\n\n
                      \u2705 Duy\u1ec7t danh s\u00e1ch li\u00ean k\u1ebft<\/strong><\/h3>\n\n\n\n
                      void printList(struct Node *head) {\n    struct Node *temp = head;\n    while (temp != NULL) {\n        printf(\"%d -> \", temp->data);\n        temp = temp->next;\n    }\n    printf(\"NULL\\n\");\n}\n<\/code><\/pre>\n\n\n\n
                      \ud83d\udca1 Gi\u1ea3i th\u00edch:<\/strong><\/p>\n\n\n\n
                        \n
                      • Duy\u1ec7t qua t\u1eebng n\u00fat v\u00e0 in ra gi\u00e1 tr\u1ecb c\u1ee7a n\u00f3 cho \u0111\u1ebfn khi g\u1eb7p NULL<\/strong>, d\u1ea5u hi\u1ec7u k\u1ebft th\u00fac danh s\u00e1ch.<\/li>\n<\/ul>\n\n\n\n
                        \n\n\n\n
                        \ud83d\ude80 4. Ch\u01b0\u01a1ng tr\u00ecnh ho\u00e0n ch\u1ec9nh<\/strong><\/h2>\n\n\n\n
                        #include <stdio.h>\n#include <stdlib.h>\n\nstruct Node {\n    int data;\n    struct Node *next;\n};\n\nvoid insertAtHead(struct Node **head, int value) {\n    struct Node *newNode = (struct Node*)malloc(sizeof(struct Node));\n    newNode->data = value;\n    newNode->next = *head;\n    *head = newNode;\n}\n\nvoid printList(struct Node *head) {\n    struct Node *temp = head;\n    while (temp != NULL) {\n        printf(\"%d -> \", temp->data);\n        temp = temp->next;\n    }\n    printf(\"NULL\\n\");\n}\n\nint main() {\n    struct Node *head = NULL;\n    insertAtHead(&head, 5);\n    insertAtHead(&head, 10);\n    insertAtHead(&head, 20);\n    printList(head);\n    return 0;\n}\n<\/code><\/pre>\n\n\n\n
                        \ud83d\udca1 Gi\u1ea3i th\u00edch:<\/strong>
                        Ch\u01b0\u01a1ng tr\u00ecnh n\u00e0y t\u1ea1o m\u1ed9t danh s\u00e1ch li\u00ean k\u1ebft, th\u00eam ba ph\u1ea7n t\u1eed v\u00e0o \u0111\u1ea7u danh s\u00e1ch v\u00e0 in ra danh s\u00e1ch k\u1ebft qu\u1ea3.<\/p>\n\n\n\n
                        \n\n\n\n
                        \ud83d\udd25 5. T\u1ed5ng k\u1ebft<\/strong><\/h2>\n\n\n\n
                        \ud83d\udca1 T\u00f3m t\u1eaft ki\u1ebfn th\u1ee9c quan tr\u1ecdng v\u1ec1 danh s\u00e1ch li\u00ean k\u1ebft:<\/strong>
                        \u2705 C\u1ea5u tr\u00fac d\u1eef li\u1ec7u<\/strong> \u0111\u1ed9ng, kh\u00f4ng c\u1ea7n c\u1ea5p ph\u00e1t tr\u01b0\u1edbc.
                        \u2705 Th\u00eam, x\u00f3a ph\u1ea7n t\u1eed<\/strong> nhanh ch\u00f3ng v\u00e0 d\u1ec5 d\u00e0ng.
                        \u2705 C\u00e1c lo\u1ea1i danh s\u00e1ch<\/strong> li\u00ean k\u1ebft: \u0111\u01a1n, \u0111\u00f4i, v\u00f2ng<\/strong> gi\u00fap gi\u1ea3i quy\u1ebft nhi\u1ec1u b\u00e0i to\u00e1n linh ho\u1ea1t h\u01a1n.
                        \u2705 Vi\u1ec7c thao t\u00e1c, duy\u1ec7t<\/strong> danh s\u00e1ch li\u00ean k\u1ebft r\u1ea5t quan tr\u1ecdng trong c\u00e1c \u1ee9ng d\u1ee5ng th\u1ef1c t\u1ebf.<\/p>\n\n\n\n
                        \ud83d\udcac B\u1ea1n \u0111\u00e3 t\u1eebng s\u1eed d\u1ee5ng danh s\u00e1ch li\u00ean k\u1ebft trong b\u00e0i to\u00e1n n\u00e0o ch\u01b0a? B\u00ecnh lu\u1eadn b\u00ean d\u01b0\u1edbi nh\u00e9!<\/strong> \u2b07\ufe0f\u2b07\ufe0f\u2b07\ufe0f<\/p>\n\n\n\n
                        \n\n\n\n
                        \ud83d\udccc B\u1ea1n th\u1ea5y b\u00e0i vi\u1ebft n\u00e0y h\u1eefu \u00edch? \u0110\u1eebng qu\u00ean LIKE & CHIA S\u1eba cho b\u1ea1n b\u00e8 c\u00f9ng h\u1ecdc nh\u00e9! \ud83d\ude80<\/strong><\/p>\n\n\n\n
                        \n\n\n\n
                        <\/p>\n","protected":false},"excerpt":{"rendered":"
                        B\u1ea1n \u0111\u00e3 bao gi\u1edd g\u1eb7p tr\u01b0\u1eddng h\u1ee3p kh\u00f4ng bi\u1ebft tr\u01b0\u1edbc s\u1ed1 l\u01b0\u1ee3ng ph\u1ea7n t\u1eed c\u1ea7n l\u01b0u tr\u1eef trong ch\u01b0\u01a1ng tr\u00ecnh C ch\u01b0a? Ho\u1eb7c b\u1ea1n mu\u1ed1n th\u00eam, x\u00f3a ph\u1ea7n t\u1eed m\u00e0 kh\u00f4ng c\u1ea7n…<\/p>\n","protected":false},"author":6,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-485","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/news.techjunior.vn\/index.php?rest_route=\/wp\/v2\/posts\/485","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/news.techjunior.vn\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/news.techjunior.vn\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/news.techjunior.vn\/index.php?rest_route=\/wp\/v2\/users\/6"}],"replies":[{"embeddable":true,"href":"https:\/\/news.techjunior.vn\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=485"}],"version-history":[{"count":1,"href":"https:\/\/news.techjunior.vn\/index.php?rest_route=\/wp\/v2\/posts\/485\/revisions"}],"predecessor-version":[{"id":487,"href":"https:\/\/news.techjunior.vn\/index.php?rest_route=\/wp\/v2\/posts\/485\/revisions\/487"}],"wp:attachment":[{"href":"https:\/\/news.techjunior.vn\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=485"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/news.techjunior.vn\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=485"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/news.techjunior.vn\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=485"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}