{"id":4020,"date":"2023-08-06T22:49:07","date_gmt":"2023-08-06T14:49:07","guid":{"rendered":"https:\/\/zyrastory.com\/?p=4020"},"modified":"2023-08-14T21:20:06","modified_gmt":"2023-08-14T13:20:06","slug":"leetcode-206-reverse-linked-list-solution-and-explanation-en","status":"publish","type":"post","link":"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/","title":{"rendered":"LeetCode #206\u00a0Reverse Linked List Solution &#038; Explanation"},"content":{"rendered":"<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_65 counter-hierarchy ez-toc-counter ez-toc-grey ez-toc-container-direction\">\n<div class=\"ez-toc-title-container\">\n<p class=\"ez-toc-title \" >\u5167\u5bb9\u76ee\u9304<\/p>\n<span class=\"ez-toc-title-toggle\"><a href=\"#\" class=\"ez-toc-pull-right ez-toc-btn ez-toc-btn-xs ez-toc-btn-default ez-toc-toggle\" aria-label=\"Toggle Table of Content\"><span class=\"ez-toc-js-icon-con\"><span class=\"\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #999;color:#999\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #999;color:#999\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/span><\/a><\/span><\/div>\n<nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#leetcode-problem\" title=\"LeetCode Problem\">LeetCode Problem<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#solution\" title=\"Solution\">Solution<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#c-solution\" title=\"C# Solution\">C# Solution<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#java-solution\" title=\"Java Solution\">Java Solution<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#python3-solution\" title=\"Python3 Solution\">Python3 Solution<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-6\" href=\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#javascript-solution\" title=\"JavaScript Solution\">JavaScript Solution<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-7\" href=\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#conclusion\" title=\"Conclusion\">Conclusion<\/a><\/li><\/ul><\/nav><\/div>\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"leetcode-problem\"><\/span><strong>LeetCode Problem<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Given the&nbsp;<strong>head&nbsp;<\/strong>of a singly linked list, reverse the list, and return&nbsp;<em>the reversed list<\/em>.<\/p>\n\n\n\n<figure class=\"wp-block-image size-full is-resized\"><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/zyrastory.com\/wp-content\/uploads\/2023\/08\/206-Examples.webp\" alt=\"\" class=\"wp-image-4024\" style=\"width:702px;height:980px\" width=\"702\" height=\"980\" srcset=\"https:\/\/zyrastory.com\/wp-content\/uploads\/2023\/08\/206-Examples.webp 610w, https:\/\/zyrastory.com\/wp-content\/uploads\/2023\/08\/206-Examples-215x300.webp 215w\" sizes=\"(max-width: 702px) 100vw, 702px\" \/><\/figure>\n\n\n\n<figure class=\"wp-block-image size-full is-resized\"><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/zyrastory.com\/wp-content\/uploads\/2023\/08\/206-Constraints.webp\" alt=\"\" class=\"wp-image-4025\" style=\"width:539px;height:161px\" width=\"539\" height=\"161\" srcset=\"https:\/\/zyrastory.com\/wp-content\/uploads\/2023\/08\/206-Constraints.webp 382w, https:\/\/zyrastory.com\/wp-content\/uploads\/2023\/08\/206-Constraints-300x90.webp 300w\" sizes=\"(max-width: 539px) 100vw, 539px\" \/><\/figure>\n\n\n\n<div style=\"height:15px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<p><strong>Follow up:<\/strong>&nbsp;A linked list can be reversed either iteratively or recursively. Could you implement both?<\/p>\n\n\n\n<div style=\"height:25px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"solution\"><\/span><strong>Solution<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>In my initial attempt, I stored the values of the linked list in a list. <\/p>\n\n\n\n<p>Then, I utilized the built-in function &#8220;<strong>Reverse<\/strong>&#8221; to reverse the list.<\/p>\n\n\n\n<p>Finally reconstructed the linked list based on the reversed values.<\/p>\n\n\n\n<div style=\"height:30px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"c-solution\"><\/span><strong>C# Solution<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<p><strong>Solution1<\/strong> &#8211; Easiest but not the best<\/p>\n\n\n\n<div class=\"hcb_wrap\"><pre class=\"prism undefined-numbers lang-csharp\" data-lang=\"C#\"><code>\/**\n * Definition for singly-linked list.\n * public class ListNode {\n *     public int val;\n *     public ListNode next;\n *     public ListNode(int val=0, ListNode next=null) {\n *         this.val = val;\n *         this.next = next;\n *     }\n * }\n *\/\npublic class Solution {\n    public ListNode ReverseList(ListNode head) {\n        if (head == null) \n        {\n            return null;\n        }\n\n        List&lt;int&gt;list = new List&lt;int&gt;();\n        \n        while(head!=null)\n        {\n            list.Add(head.val);\n            head = head.next;\n        }\n\n        list.Reverse();\n\n        ListNode resNode = new ListNode();\n        \n        resNode.val = list[0];\n        ListNode lastNode = resNode;\n        ListNode nowNode = null;\n        \n        for(int i = 1; i&lt;list.Count;i++)\n        {\n            nowNode = new ListNode();\n            nowNode.val = list[i];\n            lastNode.next = nowNode;\n            \n            lastNode = nowNode;\n        }\n\n        return resNode;\n    }\n}<\/code><\/pre><\/div>\n\n\n\n<p>When the size of the linked list becomes larger, the <strong>Reverse <\/strong>operation will take longer time.<\/p>\n\n\n\n<div style=\"height:30px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<p>\u2b50<strong>Solution2<\/strong> &#8211; finish without using extra space<\/p>\n\n\n\n<div class=\"hcb_wrap\"><pre class=\"prism undefined-numbers lang-csharp\" data-lang=\"C#\"><code>public class Solution {\n    public ListNode ReverseList(ListNode head) {\n        if (head == null) \n        {\n            return null;\n        }\n\n        ListNode prev = null;\n        ListNode curr = head;\n\n        while (curr != null) \n        {\n            ListNode next = curr.next;\n            curr.next = prev;\n            prev = curr;\n            curr = next;\n        }\n\n        return prev;\n    }\n}<\/code><\/pre><\/div>\n\n\n\n<div style=\"height:45px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"java-solution\"><\/span><strong>Java Solution<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<p><strong>Solution1<\/strong><\/p>\n\n\n\n<div class=\"hcb_wrap\"><pre class=\"prism undefined-numbers lang-java\" data-lang=\"Java\"><code>\/**\n * Definition for singly-linked list.\n * public class ListNode {\n *     int val;\n *     ListNode next;\n *     ListNode() {}\n *     ListNode(int val) { this.val = val; }\n *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }\n * }\n *\/\nclass Solution {\n    public ListNode reverseList(ListNode head) {\n        if (head == null) \n        {\n            return null;\n        }\n\n        List&lt;Integer&gt; list = new ArrayList&lt;&gt;();\n\n        while (head != null) \n        {\n            list.add(head.val);\n            head = head.next;\n        }\n\n        Collections.reverse(list);\n\n        ListNode resNode = new ListNode(list.get(0));\n        ListNode lastNode = resNode;\n        ListNode nowNode = null;\n\n        for (int i = 1; i &lt; list.size(); i++)\n         {\n            nowNode = new ListNode(list.get(i));\n            lastNode.next = nowNode;\n            lastNode = nowNode;\n        }\n\n        return resNode;\n    }\n}<\/code><\/pre><\/div>\n\n\n\n<div style=\"height:30px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<p>\u2b50<strong>Solution2<\/strong><\/p>\n\n\n\n<div class=\"hcb_wrap\"><pre class=\"prism undefined-numbers lang-java\" data-lang=\"Java\"><code>\/**\n * Definition for singly-linked list.\n * public class ListNode {\n *     int val;\n *     ListNode next;\n *     ListNode() {}\n *     ListNode(int val) { this.val = val; }\n *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }\n * }\n *\/\nclass Solution {\n    public ListNode reverseList(ListNode head) {\n        if (head == null) \n        {\n            return null;\n        }\n\n        ListNode prev = null;\n        ListNode curr = head;\n\n        while (curr != null) \n        {\n            ListNode next = curr.next;\n            curr.next = prev;\n            prev = curr;\n            curr = next;\n        }\n\n        return prev;\n    }\n}<\/code><\/pre><\/div>\n\n\n\n<div style=\"height:45px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"python3-solution\"><\/span><strong>Python3 Solution<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<p><strong>Solution1<\/strong><\/p>\n\n\n\n<div class=\"hcb_wrap\"><pre class=\"prism undefined-numbers lang-python\" data-lang=\"Python\"><code># Definition for singly-linked list.\n# class ListNode:\n#     def __init__(self, val=0, next=None):\n#         self.val = val\n#         self.next = next\nclass Solution:\n    def reverseList(self, head: Optional[ListNode]) -&gt; Optional[ListNode]:\n        if not head:\n            return None\n\n        list = []\n        while head:\n            list.append(head.val)\n            head = head.next\n\n        list.reverse()\n\n        resNode = ListNode(list[0])\n        lastNode = resNode\n        nowNode = None\n\n        for i in range(1, len(list)):\n            nowNode = ListNode(list[i])\n            lastNode.next = nowNode\n            lastNode = nowNode\n\n        return resNode<\/code><\/pre><\/div>\n\n\n\n<div style=\"height:30px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<p>\u2b50<strong>Solution2<\/strong><\/p>\n\n\n\n<div class=\"hcb_wrap\"><pre class=\"prism undefined-numbers lang-python\" data-lang=\"Python\"><code># Definition for singly-linked list.\n# class ListNode:\n#     def __init__(self, val=0, next=None):\n#         self.val = val\n#         self.next = next\nclass Solution:\n    def reverseList(self, head: Optional[ListNode]) -&gt; Optional[ListNode]:\n        if not head:\n            return None\n\n        prev = None\n        curr = head\n\n        while curr:\n            next_node = curr.next\n            curr.next = prev\n            prev = curr\n            curr = next_node\n\n        return prev<\/code><\/pre><\/div>\n\n\n\n<div style=\"height:45px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"javascript-solution\"><\/span><strong>JavaScript Solution<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<p><strong>Solution1<\/strong><\/p>\n\n\n\n<div class=\"hcb_wrap\"><pre class=\"prism undefined-numbers lang-js\" data-lang=\"JavaScript\"><code>\/**\n * Definition for singly-linked list.\n * function ListNode(val, next) {\n *     this.val = (val===undefined ? 0 : val)\n *     this.next = (next===undefined ? null : next)\n * }\n *\/\n\/**\n * @param {ListNode} head\n * @return {ListNode}\n *\/\nvar reverseList = function(head) {\n    if (!head) \n    {\n        return null;\n    }\n\n    let arr = [];\n    while (head) \n    {\n        arr.push(head.val);\n        head = head.next;\n    }\n\n    arr.reverse();\n\n    let resNode = new ListNode(arr[0]);\n    let lastNode = resNode;\n    let nowNode = null;\n\n    for (let i = 1; i &lt; arr.length; i++) \n    {\n        nowNode = new ListNode(arr[i]);\n        lastNode.next = nowNode;\n        lastNode = nowNode;\n    }\n\n    return resNode;\n};<\/code><\/pre><\/div>\n\n\n\n<div style=\"height:45px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<p>\u2b50<strong>Solution2<\/strong><\/p>\n\n\n\n<div class=\"hcb_wrap\"><pre class=\"prism undefined-numbers lang-js\" data-lang=\"JavaScript\"><code>\/**\n * Definition for singly-linked list.\n * function ListNode(val, next) {\n *     this.val = (val===undefined ? 0 : val)\n *     this.next = (next===undefined ? null : next)\n * }\n *\/\n\/**\n * @param {ListNode} head\n * @return {ListNode}\n *\/\nvar reverseList = function(head) {\n    if (!head) \n    {\n        return null;\n    }\n\n    let prev = null;\n    let curr = head;\n\n    while (curr) \n    {\n        let nextNode = curr.next;\n        curr.next = prev;\n        prev = curr;\n        curr = nextNode;\n    }\n\n    return prev;\n};<\/code><\/pre><\/div>\n\n\n\n<div style=\"height:30px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\"\/>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"tw-target-text\"><span class=\"ez-toc-section\" id=\"conclusion\"><\/span><strong>Conclusion<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<div style=\"height:45px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<p class=\"has-medium-font-size\">\ud83e\udde1<strong>If my solution helps, that is my honor!<\/strong><\/p>\n\n\n\n<p>\ud83e\udde1<strong>You can support me by clicking some ad or sharing my posts, thanks a lot<\/strong><\/p>\n\n\n\n<p>\u2705<strong>If you got any problem about the explanation, please feel free to let me know<\/strong><\/p>\n\n\n\n<div style=\"height:30px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<p><strong>The problem link :<\/strong> <a href=\"https:\/\/leetcode.com\/problems\/reverse-linked-list\/\" target=\"_blank\" rel=\"noreferrer noopener\">Reverse Linked List &#8211; LeetCode<\/a><\/p>\n\n\n\n<div style=\"height:40px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<p><strong>Some Random post<\/strong><\/p>\n\n\n\n\t\t\t<div class=\"wp-block-uagb-post-grid uagb-post-grid  uagb-post__image-position-top uagb-post__image-disabled uagb-block-69c5ee19     uagb-post__items uagb-post__columns-3 is-grid uagb-post__columns-tablet-2 uagb-post__columns-mobile-1 uagb-post__equal-height\" data-total=\"67\" style=\"\">\n\n\t\t\t\t\t\t\t\t\t\t\t\t<article class=\"uagb-post__inner-wrap\">\t\t\t\t\t\t\t\t<h4 class=\"uagb-post__title uagb-post__text\">\n\t\t\t\t<a href=\"https:\/\/zyrastory.com\/en\/coding-en\/codeforces-en\/codeforces-546b-soldier-and-badges-solution-and-explanation-en\/\" target=\"_self\" rel=\"bookmark noopener noreferrer\">Codeforces 546B Soldier and Badges Solution &amp; Explanation<\/a>\n\t\t\t<\/h4>\n\t\t\t\t\t\t<div class='uagb-post__text uagb-post-grid-byline'>\n\t\t\t\t\t\t\t\t<time datetime=\"2024-04-06T23:33:53+08:00\" class=\"uagb-post__date\">\n\t\t\t\t<span class=\"dashicons-calendar dashicons\"><\/span>\t\t\t\t\t2024-04-06\t\t\t\t<\/time>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<div class=\"uagb-post__text uagb-post__cta wp-block-button\">\n\t\t\t\t<a class=\"wp-block-button__link uagb-text-link\" href=\"https:\/\/zyrastory.com\/en\/coding-en\/codeforces-en\/codeforces-546b-soldier-and-badges-solution-and-explanation-en\/\" target=\"_self\" rel=\"bookmark noopener noreferrer\">Read More<\/a>\n\t\t\t<\/div>\n\t\t\t\t\t\t\t\t\t\t\t\t<\/article>\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<article class=\"uagb-post__inner-wrap\">\t\t\t\t\t\t\t\t<h4 class=\"uagb-post__title uagb-post__text\">\n\t\t\t\t<a href=\"https:\/\/zyrastory.com\/coding\/leetcode\/leetcode-21-merge-two-sorted-lists-solution-and-translate\/\" target=\"_self\" rel=\"bookmark noopener noreferrer\">LeetCode #21\u00a0Merge Two Sorted Lists \u5408\u4f75\u5169\u500b\u5df2\u6392\u5e8f\u7684\u93c8\u7d50\u4e32\u5217<\/a>\n\t\t\t<\/h4>\n\t\t\t\t\t\t<div class='uagb-post__text uagb-post-grid-byline'>\n\t\t\t\t\t\t\t\t<time datetime=\"2022-12-06T22:54:43+08:00\" class=\"uagb-post__date\">\n\t\t\t\t<span class=\"dashicons-calendar dashicons\"><\/span>\t\t\t\t\t2022-12-06\t\t\t\t<\/time>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<div class=\"uagb-post__text uagb-post__cta wp-block-button\">\n\t\t\t\t<a class=\"wp-block-button__link uagb-text-link\" href=\"https:\/\/zyrastory.com\/coding\/leetcode\/leetcode-21-merge-two-sorted-lists-solution-and-translate\/\" target=\"_self\" rel=\"bookmark noopener noreferrer\">Read More<\/a>\n\t\t\t<\/div>\n\t\t\t\t\t\t\t\t\t\t\t\t<\/article>\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<article class=\"uagb-post__inner-wrap\">\t\t\t\t\t\t\t\t<h4 class=\"uagb-post__title uagb-post__text\">\n\t\t\t\t<a href=\"https:\/\/zyrastory.com\/coding\/note\/how-to-prevent-browser-cache-from-blocking-css\/\" target=\"_self\" rel=\"bookmark noopener noreferrer\">\u5982\u4f55\u5728\u6e2c\u8a66\u6642\u907f\u514dCSS\u88ab\u700f\u89bd\u5668\u5feb\u53d6\u64cb\u4f4f<\/a>\n\t\t\t<\/h4>\n\t\t\t\t\t\t<div class='uagb-post__text uagb-post-grid-byline'>\n\t\t\t\t\t\t\t\t<time datetime=\"2023-12-28T23:39:17+08:00\" class=\"uagb-post__date\">\n\t\t\t\t<span class=\"dashicons-calendar dashicons\"><\/span>\t\t\t\t\t2023-12-28\t\t\t\t<\/time>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<div class=\"uagb-post__text uagb-post__cta wp-block-button\">\n\t\t\t\t<a class=\"wp-block-button__link uagb-text-link\" href=\"https:\/\/zyrastory.com\/coding\/note\/how-to-prevent-browser-cache-from-blocking-css\/\" target=\"_self\" rel=\"bookmark noopener noreferrer\">Read More<\/a>\n\t\t\t<\/div>\n\t\t\t\t\t\t\t\t\t\t\t\t<\/article>\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<article class=\"uagb-post__inner-wrap\">\t\t\t\t\t\t\t\t<h4 class=\"uagb-post__title uagb-post__text\">\n\t\t\t\t<a href=\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-242-valid-anagram-solution-and-explanation\/\" target=\"_self\" rel=\"bookmark noopener noreferrer\">LeetCode #242\u00a0Valid Anagram Solution &#038; Explanation<\/a>\n\t\t\t<\/h4>\n\t\t\t\t\t\t<div class='uagb-post__text uagb-post-grid-byline'>\n\t\t\t\t\t\t\t\t<time datetime=\"2022-12-31T23:01:29+08:00\" class=\"uagb-post__date\">\n\t\t\t\t<span class=\"dashicons-calendar dashicons\"><\/span>\t\t\t\t\t2022-12-31\t\t\t\t<\/time>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<div class=\"uagb-post__text uagb-post__cta wp-block-button\">\n\t\t\t\t<a class=\"wp-block-button__link uagb-text-link\" href=\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-242-valid-anagram-solution-and-explanation\/\" target=\"_self\" rel=\"bookmark noopener noreferrer\">Read More<\/a>\n\t\t\t<\/div>\n\t\t\t\t\t\t\t\t\t\t\t\t<\/article>\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<article class=\"uagb-post__inner-wrap\">\t\t\t\t\t\t\t\t<h4 class=\"uagb-post__title uagb-post__text\">\n\t\t\t\t<a href=\"https:\/\/zyrastory.com\/coding\/note\/c-sharp-asp-net-do-something-while-application-start\/\" target=\"_self\" rel=\"bookmark noopener noreferrer\">C# ASP.NET &#8211; \u61c9\u7528\u7a0b\u5f0f\u555f\u52d5\u6642\u57f7\u884c\u52d5\u4f5c<\/a>\n\t\t\t<\/h4>\n\t\t\t\t\t\t<div class='uagb-post__text uagb-post-grid-byline'>\n\t\t\t\t\t\t\t\t<time datetime=\"2023-10-17T22:52:52+08:00\" class=\"uagb-post__date\">\n\t\t\t\t<span class=\"dashicons-calendar dashicons\"><\/span>\t\t\t\t\t2023-10-17\t\t\t\t<\/time>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<div class=\"uagb-post__text uagb-post__cta wp-block-button\">\n\t\t\t\t<a class=\"wp-block-button__link uagb-text-link\" href=\"https:\/\/zyrastory.com\/coding\/note\/c-sharp-asp-net-do-something-while-application-start\/\" target=\"_self\" rel=\"bookmark noopener noreferrer\">Read More<\/a>\n\t\t\t<\/div>\n\t\t\t\t\t\t\t\t\t\t\t\t<\/article>\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<article class=\"uagb-post__inner-wrap\">\t\t\t\t\t\t\t\t<h4 class=\"uagb-post__title uagb-post__text\">\n\t\t\t\t<a href=\"https:\/\/zyrastory.com\/en\/coding-en\/codeforces-en\/codeforces-427a-police-recruits-solution-and-explanation-en\/\" target=\"_self\" rel=\"bookmark noopener noreferrer\">Codeforces 427A Police Recruits Solution &amp; Explanation<\/a>\n\t\t\t<\/h4>\n\t\t\t\t\t\t<div class='uagb-post__text uagb-post-grid-byline'>\n\t\t\t\t\t\t\t\t<time datetime=\"2024-02-27T14:31:31+08:00\" class=\"uagb-post__date\">\n\t\t\t\t<span class=\"dashicons-calendar dashicons\"><\/span>\t\t\t\t\t2024-02-27\t\t\t\t<\/time>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<div class=\"uagb-post__text uagb-post__cta wp-block-button\">\n\t\t\t\t<a class=\"wp-block-button__link uagb-text-link\" href=\"https:\/\/zyrastory.com\/en\/coding-en\/codeforces-en\/codeforces-427a-police-recruits-solution-and-explanation-en\/\" target=\"_self\" rel=\"bookmark noopener noreferrer\">Read More<\/a>\n\t\t\t<\/div>\n\t\t\t\t\t\t\t\t\t\t\t\t<\/article>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<div class=\"uagb-post-pagination-wrap\">\n\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t","protected":false},"excerpt":{"rendered":"<p>Sometimes, the Easiest way may not be the best answer. We can store the values of it than rebuild&#8230;But, if there a better way?<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_uag_custom_page_level_css":"","footnotes":""},"categories":[62],"tags":[182,84,88,78,79,82],"blocksy_meta":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v22.6 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>LeetCode #206\u00a0Reverse Linked List Solution &amp; Explanation - zyrastory\u7a0b\u5f0f\u7f8e\u98df\u7814\u7a76\u4e2d\u5fc3<\/title>\n<meta name=\"description\" content=\"Sometimes, the Easiest way may not be the best answer. We can store the values of it than rebuild...But, if there a better way?\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/\" \/>\n<meta property=\"og:locale\" content=\"zh_TW\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"LeetCode #206\u00a0Reverse Linked List Solution &amp; Explanation - zyrastory\u7a0b\u5f0f\u7f8e\u98df\u7814\u7a76\u4e2d\u5fc3\" \/>\n<meta property=\"og:description\" content=\"Sometimes, the Easiest way may not be the best answer. We can store the values of it than rebuild...But, if there a better way?\" \/>\n<meta property=\"og:url\" content=\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/\" \/>\n<meta property=\"og:site_name\" content=\"zyrastory\u7a0b\u5f0f\u7f8e\u98df\u7814\u7a76\u4e2d\u5fc3\" \/>\n<meta property=\"article:published_time\" content=\"2023-08-06T14:49:07+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2023-08-14T13:20:06+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/zyrastory.com\/wp-content\/uploads\/2023\/08\/206-Examples.webp\" \/>\n<meta name=\"author\" content=\"zyrastory\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"\u4f5c\u8005:\" \/>\n\t<meta name=\"twitter:data1\" content=\"zyrastory\" \/>\n\t<meta name=\"twitter:label2\" content=\"\u9810\u4f30\u95b1\u8b80\u6642\u9593\" \/>\n\t<meta name=\"twitter:data2\" content=\"4 \u5206\u9418\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/\"},\"author\":{\"name\":\"zyrastory\",\"@id\":\"https:\/\/zyrastory.com\/#\/schema\/person\/0d3b4bc5302f8e3dd68cbb6464b888dd\"},\"headline\":\"LeetCode #206\u00a0Reverse Linked List Solution &#038; Explanation\",\"datePublished\":\"2023-08-06T14:49:07+00:00\",\"dateModified\":\"2023-08-14T13:20:06+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/\"},\"wordCount\":175,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/zyrastory.com\/#\/schema\/person\/0d3b4bc5302f8e3dd68cbb6464b888dd\"},\"image\":{\"@id\":\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/zyrastory.com\/wp-content\/uploads\/2023\/08\/206-Examples.webp\",\"keywords\":[\"Blind 75\",\"LeetCode C#Solution\",\"LeetCode Easy\",\"LeetCode Java Solution\",\"LeetCode JavaScript Solution\",\"LeetCode Python3 Solution\"],\"articleSection\":[\"LeetCode Solution\"],\"inLanguage\":\"zh-TW\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/\",\"url\":\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/\",\"name\":\"LeetCode #206\u00a0Reverse Linked List Solution & Explanation - zyrastory\u7a0b\u5f0f\u7f8e\u98df\u7814\u7a76\u4e2d\u5fc3\",\"isPartOf\":{\"@id\":\"https:\/\/zyrastory.com\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/zyrastory.com\/wp-content\/uploads\/2023\/08\/206-Examples.webp\",\"datePublished\":\"2023-08-06T14:49:07+00:00\",\"dateModified\":\"2023-08-14T13:20:06+00:00\",\"description\":\"Sometimes, the Easiest way may not be the best answer. We can store the values of it than rebuild...But, if there a better way?\",\"breadcrumb\":{\"@id\":\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#breadcrumb\"},\"inLanguage\":\"zh-TW\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"zh-TW\",\"@id\":\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#primaryimage\",\"url\":\"https:\/\/zyrastory.com\/wp-content\/uploads\/2023\/08\/206-Examples.webp\",\"contentUrl\":\"https:\/\/zyrastory.com\/wp-content\/uploads\/2023\/08\/206-Examples.webp\",\"width\":610,\"height\":852},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"\u9996\u9801\",\"item\":\"https:\/\/zyrastory.com\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"LeetCode #206\u00a0Reverse Linked List Solution &#038; Explanation\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/zyrastory.com\/#website\",\"url\":\"https:\/\/zyrastory.com\/\",\"name\":\"zyrastory\u7a0b\u5f0f\u7f8e\u98df\u7814\u7a76\u4e2d\u5fc3\",\"description\":\"\u53ea\u662f\u500b\u559c\u6b61\u5206\u4eab\u7684\u5c0f\u5de5\u7a0b\u5e2b\",\"publisher\":{\"@id\":\"https:\/\/zyrastory.com\/#\/schema\/person\/0d3b4bc5302f8e3dd68cbb6464b888dd\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/zyrastory.com\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"zh-TW\"},{\"@type\":[\"Person\",\"Organization\"],\"@id\":\"https:\/\/zyrastory.com\/#\/schema\/person\/0d3b4bc5302f8e3dd68cbb6464b888dd\",\"name\":\"zyrastory\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"zh-TW\",\"@id\":\"https:\/\/zyrastory.com\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/c0f3eeb72ed82297486aa0323b8a29fb?s=96&d=identicon&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/c0f3eeb72ed82297486aa0323b8a29fb?s=96&d=identicon&r=g\",\"caption\":\"zyrastory\"},\"logo\":{\"@id\":\"https:\/\/zyrastory.com\/#\/schema\/person\/image\/\"},\"sameAs\":[\"https:\/\/zyrastory.com\"],\"url\":\"https:\/\/zyrastory.com\/author\/zyrastory\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"LeetCode #206\u00a0Reverse Linked List Solution & Explanation - zyrastory\u7a0b\u5f0f\u7f8e\u98df\u7814\u7a76\u4e2d\u5fc3","description":"Sometimes, the Easiest way may not be the best answer. We can store the values of it than rebuild...But, if there a better way?","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/","og_locale":"zh_TW","og_type":"article","og_title":"LeetCode #206\u00a0Reverse Linked List Solution & Explanation - zyrastory\u7a0b\u5f0f\u7f8e\u98df\u7814\u7a76\u4e2d\u5fc3","og_description":"Sometimes, the Easiest way may not be the best answer. We can store the values of it than rebuild...But, if there a better way?","og_url":"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/","og_site_name":"zyrastory\u7a0b\u5f0f\u7f8e\u98df\u7814\u7a76\u4e2d\u5fc3","article_published_time":"2023-08-06T14:49:07+00:00","article_modified_time":"2023-08-14T13:20:06+00:00","og_image":[{"url":"https:\/\/zyrastory.com\/wp-content\/uploads\/2023\/08\/206-Examples.webp"}],"author":"zyrastory","twitter_card":"summary_large_image","twitter_misc":{"\u4f5c\u8005:":"zyrastory","\u9810\u4f30\u95b1\u8b80\u6642\u9593":"4 \u5206\u9418"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#article","isPartOf":{"@id":"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/"},"author":{"name":"zyrastory","@id":"https:\/\/zyrastory.com\/#\/schema\/person\/0d3b4bc5302f8e3dd68cbb6464b888dd"},"headline":"LeetCode #206\u00a0Reverse Linked List Solution &#038; Explanation","datePublished":"2023-08-06T14:49:07+00:00","dateModified":"2023-08-14T13:20:06+00:00","mainEntityOfPage":{"@id":"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/"},"wordCount":175,"commentCount":0,"publisher":{"@id":"https:\/\/zyrastory.com\/#\/schema\/person\/0d3b4bc5302f8e3dd68cbb6464b888dd"},"image":{"@id":"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#primaryimage"},"thumbnailUrl":"https:\/\/zyrastory.com\/wp-content\/uploads\/2023\/08\/206-Examples.webp","keywords":["Blind 75","LeetCode C#Solution","LeetCode Easy","LeetCode Java Solution","LeetCode JavaScript Solution","LeetCode Python3 Solution"],"articleSection":["LeetCode Solution"],"inLanguage":"zh-TW","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/","url":"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/","name":"LeetCode #206\u00a0Reverse Linked List Solution & Explanation - zyrastory\u7a0b\u5f0f\u7f8e\u98df\u7814\u7a76\u4e2d\u5fc3","isPartOf":{"@id":"https:\/\/zyrastory.com\/#website"},"primaryImageOfPage":{"@id":"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#primaryimage"},"image":{"@id":"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#primaryimage"},"thumbnailUrl":"https:\/\/zyrastory.com\/wp-content\/uploads\/2023\/08\/206-Examples.webp","datePublished":"2023-08-06T14:49:07+00:00","dateModified":"2023-08-14T13:20:06+00:00","description":"Sometimes, the Easiest way may not be the best answer. We can store the values of it than rebuild...But, if there a better way?","breadcrumb":{"@id":"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#breadcrumb"},"inLanguage":"zh-TW","potentialAction":[{"@type":"ReadAction","target":["https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/"]}]},{"@type":"ImageObject","inLanguage":"zh-TW","@id":"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#primaryimage","url":"https:\/\/zyrastory.com\/wp-content\/uploads\/2023\/08\/206-Examples.webp","contentUrl":"https:\/\/zyrastory.com\/wp-content\/uploads\/2023\/08\/206-Examples.webp","width":610,"height":852},{"@type":"BreadcrumbList","@id":"https:\/\/zyrastory.com\/en\/coding-en\/leetcode-en\/leetcode-206-reverse-linked-list-solution-and-explanation-en\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"\u9996\u9801","item":"https:\/\/zyrastory.com\/"},{"@type":"ListItem","position":2,"name":"LeetCode #206\u00a0Reverse Linked List Solution &#038; Explanation"}]},{"@type":"WebSite","@id":"https:\/\/zyrastory.com\/#website","url":"https:\/\/zyrastory.com\/","name":"zyrastory\u7a0b\u5f0f\u7f8e\u98df\u7814\u7a76\u4e2d\u5fc3","description":"\u53ea\u662f\u500b\u559c\u6b61\u5206\u4eab\u7684\u5c0f\u5de5\u7a0b\u5e2b","publisher":{"@id":"https:\/\/zyrastory.com\/#\/schema\/person\/0d3b4bc5302f8e3dd68cbb6464b888dd"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/zyrastory.com\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"zh-TW"},{"@type":["Person","Organization"],"@id":"https:\/\/zyrastory.com\/#\/schema\/person\/0d3b4bc5302f8e3dd68cbb6464b888dd","name":"zyrastory","image":{"@type":"ImageObject","inLanguage":"zh-TW","@id":"https:\/\/zyrastory.com\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/c0f3eeb72ed82297486aa0323b8a29fb?s=96&d=identicon&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/c0f3eeb72ed82297486aa0323b8a29fb?s=96&d=identicon&r=g","caption":"zyrastory"},"logo":{"@id":"https:\/\/zyrastory.com\/#\/schema\/person\/image\/"},"sameAs":["https:\/\/zyrastory.com"],"url":"https:\/\/zyrastory.com\/author\/zyrastory\/"}]}},"uagb_featured_image_src":{"full":false,"thumbnail":false,"medium":false,"medium_large":false,"large":false,"1536x1536":false,"2048x2048":false},"uagb_author_info":{"display_name":"zyrastory","author_link":"https:\/\/zyrastory.com\/author\/zyrastory\/"},"uagb_comment_info":0,"uagb_excerpt":"Sometimes, the Easiest way may not be the best answer. ...","_links":{"self":[{"href":"https:\/\/zyrastory.com\/wp-json\/wp\/v2\/posts\/4020"}],"collection":[{"href":"https:\/\/zyrastory.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zyrastory.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zyrastory.com\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zyrastory.com\/wp-json\/wp\/v2\/comments?post=4020"}],"version-history":[{"count":0,"href":"https:\/\/zyrastory.com\/wp-json\/wp\/v2\/posts\/4020\/revisions"}],"wp:attachment":[{"href":"https:\/\/zyrastory.com\/wp-json\/wp\/v2\/media?parent=4020"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zyrastory.com\/wp-json\/wp\/v2\/categories?post=4020"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zyrastory.com\/wp-json\/wp\/v2\/tags?post=4020"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}