{"id":174,"date":"2022-02-17T19:51:51","date_gmt":"2022-02-17T11:51:51","guid":{"rendered":"http:\/\/nas.hepcloud.top:7000\/?p=174"},"modified":"2022-02-17T19:51:51","modified_gmt":"2022-02-17T11:51:51","slug":"2%e3%80%81%e4%b8%a4%e6%95%b0%e7%9b%b8%e5%8a%a0","status":"publish","type":"post","link":"http:\/\/www.huerpu.cc:7000\/?p=174","title":{"rendered":"2\u3001\u4e24\u6570\u76f8\u52a0"},"content":{"rendered":"\n\n\n

\u7ed9\u4f60\u4e24\u4e2a\u975e\u7a7a<\/strong>\u7684\u94fe\u8868\uff0c\u8868\u793a\u4e24\u4e2a\u975e\u8d1f\u7684\u6574\u6570\u3002\u5b83\u4eec\u6bcf\u4f4d\u6570\u5b57\u90fd\u662f\u6309\u7167\u9006\u5e8f<\/strong>\u7684\u65b9\u5f0f\u5b58\u50a8\u7684\uff0c\u5e76\u4e14\u6bcf\u4e2a\u8282\u70b9\u53ea\u80fd\u5b58\u50a8 \u4e00\u4f4d \u6570\u5b57\u3002<\/p>\n\n\n

\u8bf7\u4f60\u5c06\u4e24\u4e2a\u6570\u76f8\u52a0\uff0c\u5e76\u4ee5\u76f8\u540c\u5f62\u5f0f\u8fd4\u56de\u4e00\u4e2a\u8868\u793a\u548c\u7684\u94fe\u8868\u3002<\/p>\n\n\n

\u4f60\u53ef\u4ee5\u5047\u8bbe\u9664\u4e86\u6570\u5b57 0 \u4e4b\u5916\uff0c\u8fd9\u4e24\u4e2a\u6570\u90fd\u4e0d\u4f1a\u4ee5 0 \u5f00\u5934\u3002<\/p>\n\n\n

\u793a\u4f8b1\uff1a<\/strong><\/p>\n\n\n

\u8f93\u5165\uff1al1 = [2,4,3], l2 = [5,6,4]\n\u8f93\u51fa\uff1a[7,0,8]\n\u89e3\u91ca\uff1a342 + 465 = 807.<\/code><\/pre>\n\n\n
\u793a\u4f8b2\uff1a<\/strong><\/p>\n\n\n
\u8f93\u5165\uff1al1 = [0], l2 = [0]\n\u8f93\u51fa\uff1a[0]<\/code><\/pre>\n\n\n
\u793a\u4f8b3\uff1a<\/strong><\/p>\n\n\n
\u8f93\u5165\uff1al1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]\n\u8f93\u51fa\uff1a[8,9,9,9,0,0,0,1]<\/code><\/pre>\n\n\n
\u63d0\u793a\uff1a<\/strong><\/p>\n\n\n
  • \u6bcf\u4e2a\u94fe\u8868\u4e2d\u7684\u8282\u70b9\u6570\u5728\u8303\u56f4 [1, 100]<\/code> \u5185<\/li>
  • 0 <= Node.val <= 9<\/code><\/li>
  • \u9898\u76ee\u6570\u636e\u4fdd\u8bc1\u5217\u8868\u8868\u793a\u7684\u6570\u5b57\u4e0d\u542b\u524d\u5bfc\u96f6<\/li><\/ul>\n\n\n
    Java\u4ee3\u7801\u5b9e\u73b0\uff1a<\/strong><\/p>\n\n\n
    package com.huerpu.leecode;\n\npublic class LeeCode0002 {\n    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    class Solution {\n        public ListNode addTwoNumbers(ListNode l1, ListNode l2) {\n            \/\/\u8fd4\u56de\u7ed3\u679c\n            ListNode result = null;\n\n            \/\/\u4e3a\u4e86\u4e0d\u6539\u53d8\u539f\u6709l1\u3001l2\u7684\u503c\uff0c\u53e6\u5916\u4f7f\u7528p1\u3001p2\u5206\u522b\u66ff\u4ee3l1\u3001l2\n            ListNode p1 = l1;\n            ListNode p2 = l2;\n            int jinwei = 0;\n            int temp = 0;\n            ListNode p = null;\n            \/\/\u4e24\u4e2alistNode\u90fd\u6709\u503c\n            while(p1 != null && p2 != null){\n                temp = p1.val + p2.val + jinwei;\n                ListNode node = new ListNode(temp % 10,null);\n                jinwei = temp \/ 10;\n                if(result == null){\n                    result = node;\n                    p = node;\n                }else{\n                    p.next = node;\n                    p = node;\n                }\n                p1 = p1.next;\n                p2 = p2.next;\n            }\n\n            \/\/l1\u6709\u503c\n            while(p1 != null){\n                ListNode node = new ListNode((p1.val + jinwei) % 10,null);\n                jinwei = (p1.val + jinwei) \/ 10;\n                p.next = node;\n                p = node;\n                p1 = p1.next;\n            }\n\n            \/\/l2\u6709\u503c\n            while(p2 != null){\n                ListNode node = new ListNode((p2.val + jinwei) % 10,null);\n                jinwei = (p2.val + jinwei) \/ 10;\n                p.next = node;\n                p = node;\n                p2 = p2.next;\n            }\n\n            \/\/\u5904\u7406\u6700\u540e\u4e00\u4e2a\u8fdb\u4f4d\uff0c\u5047\u5982\u6709\u7684\u8bdd\n            if(jinwei == 1){\n                ListNode node = new ListNode(1,null);\n                p.next = node;\n            }\n\n            return result;\n        }\n    }\n}<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
    \u7ed9\u4f60\u4e24\u4e2a\u975e\u7a7a\u7684\u94fe\u8868\uff0c\u8868\u793a\u4e24\u4e2a\u975e\u8d1f\u7684\u6574\u6570\u3002\u5b83\u4eec\u6bcf\u4f4d\u6570\u5b57\u90fd\u662f\u6309\u7167\u9006\u5e8f\u7684\u65b9\u5f0f\u5b58\u50a8\u7684\uff0c\u5e76\u4e14\u6bcf\u4e2a\u8282\u70b9\u53ea\u80fd\u5b58\u50a8 \u4e00\u4f4d \u6570\u5b57 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3],"tags":[],"class_list":["post-174","post","type-post","status-publish","format-standard","hentry","category-leecode"],"_links":{"self":[{"href":"http:\/\/www.huerpu.cc:7000\/index.php?rest_route=\/wp\/v2\/posts\/174","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.huerpu.cc:7000\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.huerpu.cc:7000\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.huerpu.cc:7000\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.huerpu.cc:7000\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=174"}],"version-history":[{"count":0,"href":"http:\/\/www.huerpu.cc:7000\/index.php?rest_route=\/wp\/v2\/posts\/174\/revisions"}],"wp:attachment":[{"href":"http:\/\/www.huerpu.cc:7000\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=174"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.huerpu.cc:7000\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=174"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.huerpu.cc:7000\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=174"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}