}if(carry == 1) cur.next =newListNode(1);returndummy.next; } } 此解法来自 http://www.cnblogs.com/grandyang/p/4129891.html Java解法2: /*** Definition for singly-linked list. * public class ListNode { * int val; * List
* 002-Add Two Numbers (单链表表示的两个数相加) *@paraml1 第一个数 *@paraml2 第二个数 *@return结果 */publicListNodeaddTwoNumbers(ListNode l1, ListNode l2){if(l1 ==null) {returnl2; }if(l2 ==null) {returnl1; }ListNodep1=l1;ListNodep2=l2;ListNoderoot=newListNode(0);// 头结点ListNo...
import java.util.Scanner; public class ListNodeMain { private static Scanner sc; public static void main(String[] args) { System.out.println("start ..."); ListNode l1 = new ListNode(0), tmpListNode1 = l1; ListNode l2 = new ListNode(0), tmpListNode2 = l2; sc = new Scanner(System....
l2.add(new ListNode(4)); ListNode listNode = new AddTwoNumbers().addTwoNumbers(l1, l2); System.out.println(listNode.val); while (listNode.next != null) { System.out.println(listNode.next.val); listNode = listNode.next; } } } class ListNode { int val; ListNode next; ListNode(int x...
Java版本 /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ class Solution { public ListNode addTwoNumbers(ListNode l1, ListNode l2) { ListNode current = new ListNode(0); ...
Leetcode刷题笔记2:Add Two Numbers(C语言) 错误示范: 开始的时候,我想的比较简单,就输入的时候直接倒转得到数n1,同理得n2, 然后相加得n后,取余尾插法就逆转数字了,如下: /** * Definition for singly-linked list. * struct ListNode { * int val; * struct ... ...
public ListNode addTwoNumbers(ListNode l1, ListNode l2) { ListNode n = new ListNode(0); ListNode p = l1,q=l2,c=n; int carry=0; while(p!=null||q!=null) { int x = (p!=null)?p.val:0; int y = (q!=null)?q.val:0; ...
publicstaticListNodeaddTwoNumbers2(ListNode l1,ListNode l2){// 边界条件判断if(l1==null){returnl2;}elseif(l2==null){returnl1;}ListNode list=null;ListNode next=null;// 记录和值int sum=0;// 记录是否有进位int b=0;while(l1!=null||l2!=null){if(l1!=null){sum=l1.val;l1=l1.next;}if...
Add Two Numbers You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return i...LeetCode 2. Add Two Numbers 给出两个 非空 的链表用来表示两个非...
addTwoNumbers(l1, l2); String out = listNodeToString(ret); System.out.print(out); } } } 这个不要理所当然想成了头插法,看到测试代码才知道是尾插法,返回的ListNode也是需要尾插法的。本文参与 腾讯云自媒体同步曝光计划,分享自作者个人站点/博客。 原始发表:2018-09-22,如有侵权请联系 cloudcommunity@...