LeetCode算法(2)_兩數相加
import java.util.LinkedList; import java.util.List; /* * @lc app=leetcode.cn id=2 lang=java * * [2] 兩數相加 */ // @lc code=start /** * 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 resultNodes = new ListNode(0); ListNode currentNode = resultNodes; int loseNum = 0; do{ int a = l1==null?0:l1.val; int b = l2==null?0:l2.val; int sumNum = a+b+loseNum; currentNode.next=new ListNode((sumNum%10)); currentNode = currentNode.next; loseNum = sumNum / 10; l1 = l1==null?l1:l1.next; l2 = l2==null?l2:l2.next; } while(l1!=null || l2!=null); if(loseNum>0) currentNode.next = new ListNode(loseNum); return resultNodes.next; } } // @lc code=end
LeetCode算法(2)_兩數相加
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.