Fichas
Add Two Numbers
Fichas del conjunto (1)
- 1You 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 it as a linked list. You may assume the two numbers do not contain any leading zero, except the number 0 itself.public ListNode addTwoNumbers(ListNode l1, ListNode l2){
ListNode l3 = new ListNode(0);
ListNode curr = l3;
int carry = 0;
ListNode p = l1;
ListNode q = l2;
while(p != null || q !=null ){
int x = (p!=null)?p.val:0;
int y = (q!=null)?q.val:0;
int sum = x + y + carry;
carry = sum/10;
curr.next = new ListNode(sum % 10);
curr = curr.next;
if(p!=null) p = p.next;
if(q!=null) q = q.next;
}
if(carry > 0){
curr.next = new ListNode(carry);
}
return l3.next;
}
Información
- Descripción
- Fichas sobre Add Two Numbers, creado por Suhas S el 06/03/2018.
- Creado por
- Suhas S
- Visitas
- 8
- Etiquetas
- Valoración