标签:
题目描述:/** * Definition for singly-linked list. * public class ListNode { * public int val; * public ListNode next; * public ListNode(int x) { val = x; } * } */ public class Solution { public ListNode AddTwoNumbers(ListNode l1, ListNode l2) { ListNode node = null; ListNode head = null; var carry = 0; while(l1 != null || l2 != null){ var a = l1 != null ? l1.val : 0; var b = l2 != null ? l2.val : 0; var s = a + b + carry; var r = s % 10; if(node == null){ node = new ListNode(r); head = node; }else{ node.next = new ListNode(r); node = node.next; } carry = s / 10; if(l1 != null){ l1 = l1.next; } if(l2 != null){ l2 = l2.next; } } if(carry > 0){ var n = new ListNode(carry); node.next = n; } return head; } }
版权声明:本文为博主原创文章,未经博主允许不得转载。
标签:
原文地址:http://blog.csdn.net/lan_liang/article/details/49108345