{"id":1864,"date":"2016-03-07T17:55:11","date_gmt":"2016-03-07T09:55:11","guid":{"rendered":"http:\/\/boweihe.me\/?p=1864"},"modified":"2016-03-07T17:55:11","modified_gmt":"2016-03-07T09:55:11","slug":"leetcode-21-merge-two-sorted-lists","status":"publish","type":"post","link":"https:\/\/dayandcarrot.space\/?p=1864","title":{"rendered":"LeetCode 21. Merge Two Sorted Lists"},"content":{"rendered":"<p>\u9898\u76ee\uff1ahttps:\/\/leetcode.com\/problems\/merge-two-sorted-lists\/<br \/>\n\u4ee3\u7801\uff1a<\/p>\n<pre class=\"lang:c++ decode:true \">\/**\n * Definition for singly-linked list.\n * struct ListNode {\n *     int val;\n *     ListNode *next;\n *     ListNode(int x) : val(x), next(NULL) {}\n * };\n *\/\nclass Solution {\npublic:\n    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {\n        ListNode *currNode1 = l1;\n        ListNode *currNode2 = l2;\n        ListNode *retRoot = new ListNode(-1);\n        ListNode *prev = retRoot;\n        ListNode *curr;\n        while(currNode1 != NULL || currNode2 != NULL){\n            if(currNode1 != NULL &amp;&amp; currNode2 != NULL) {\n                if(currNo\u00e5de1-&gt;val &lt;= currNode2-&gt;val) {\n                    curr = new ListNode(currNode1-&gt;val);\n                    currNode1 = currNode1-&gt;next;\n                } else {\n                    curr = new ListNode(currNode2-&gt;val);\n                    currNode2 = currNode2-&gt;next;\n                }\n                prev-&gt;next = curr;\n                prev = prev-&gt;next;\n            } else if (currNode2 == NULL) {\n                prev-&gt;next = currNode1;\n                break;\n            } else {\n                prev-&gt;next = currNode2;\n                break;\n            }\n        }\n        return retRoot-&gt;next;\n    }\n};<\/pre>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>\u9898\u76ee\uff1ahttps:\/\/leetcode.com\/problems\/merge-two-sorted-lists\/ \u4ee3\u7801\uff1a \/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; *\/ class Solution { public: ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) { ListNode *currNode1 = l1; ListNode *currNode2 = l2; ListNode *retRoot = new ListNode(-1); ListNode *prev = retRoot; [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[4],"tags":[66],"class_list":["post-1864","post","type-post","status-publish","format-standard","hentry","category-study","tag-leetcode-oj"],"_links":{"self":[{"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/posts\/1864","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1864"}],"version-history":[{"count":0,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/posts\/1864\/revisions"}],"wp:attachment":[{"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1864"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1864"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1864"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}