链表求和问题

来源：互联网发布：js 设置radio checked 编辑：程序博客网时间：2024/06/09 23:54
package add_list;// Definition for singly-linked list.class ListNode {    int val;    ListNode next;    ListNode(int x) {        val = x;    }}public class Solution {    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {        ListNode res_list = new ListNode(-1);        ListNode traverse = res_list;        ListNode traverse_l1 = l1;        ListNode traverse_l2 = l2;        int quo = 0;        while (traverse_l1 != null && traverse_l2 != null) {            int val = traverse_l1.val + traverse_l2.val + quo;            int mod = val % 10;            traverse.next = new ListNode(mod);            traverse = traverse.next;            quo = val / 10;            traverse_l1 = traverse_l1.next;            traverse_l2 = traverse_l2.next;        }        while (traverse_l1 != null ){            int val = traverse_l1.val + quo;            int mod = val % 10;            traverse.next = new ListNode(mod);            traverse = traverse.next;            quo = val / 10;            traverse_l1 = traverse_l1.next;        }        while (traverse_l2 != null){            int val = traverse_l2.val + quo;            int mod = val % 10;            traverse.next = new ListNode(mod);            traverse = traverse.next;            quo = val / 10;            traverse_l2 = traverse_l2.next;        }        if(quo > 0){            traverse.next = new ListNode(quo);        }        return res_list.next;    }}
阅读全文
0 0