Problem Description:
You are given, linked lists representing, and non-negative numbers. The digits is stored in reverse order and all of their nodes contain a single digit. ADD the numbers and return it as a linked list.
Input: (2, 4, 3) + (5, 6, 4)
Output: 7, 0, 8
Basic ideas:
This is a simple question, one can add.
Code:
/** * Definition for singly-linked list. * public class ListNode {* int val; * ListNode Next; * listnode (int x) {* val = x; * next = null; *< c5/>} *} */public class Solution { //javapublic listnode addtwonumbers (listnode L1, ListNode L2) {ListNode RL1 = L1;L Istnode rl2 = L2; ListNode result = new ListNode (0); ListNode restmp = Result;int res = 0;while (rl1!=null | | Rl2! = NULL) {int num;if (RL1 = = null) num = Rl2.val + Res;else if (r L2 = = null) num = rl1.val + res;else num = rl1.val + rl2.val +res;if (NUM/10 >0) {res = 1;num = num%10;} else{ res = 0;} ListNode tmp = new ListNode (num); restmp.next = Tmp;restmp = Tmp;if (RL1! = null) RL1 = rl1.next;if (rl2! = null) RL2 = Rl2.next;} if (res = = 1) {ListNode tmp = new ListNode (1); restmp.next = TMP;RESTMP = tmp;} return result.next;} }
[Leetcode]add Numbers