码迷,mamicode.com
首页 > 其他好文 > 详细

[LeetCode]-algorithms-Add Two Numbers

时间:2016-03-28 10:23:45      阅读:132      评论:0      收藏:0      [点我收藏+]

标签:

You are given two linked lists representing two non-negative numbers. 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.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

分析:计算两个链表的和

解法:这道题的关键点在于节点的计算方式:sum = node1 + node2; new_node = sum%10; sum = sum/10;

public class ListNode {
  int val;
  ListNode next;
  ListNode(int x) { val = x; }
}

public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
  int carry =0;

  ListNode newHead = new ListNode(0);
  ListNode p1 = l1, p2 = l2, p3=newHead;

  while(p1 != null || p2 != null){
    if(p1 != null){
      carry += p1.val;
      p1 = p1.next;
    }

    if(p2 != null){
      carry += p2.val;
      p2 = p2.next;
    }

    p3.next = new ListNode(carry%10);
    p3 = p3.next;
    carry /= 10;
  }

  if(carry==1)
  p3.next=new ListNode(1);

  return newHead.next;
}

 

[LeetCode]-algorithms-Add Two Numbers

标签:

原文地址:http://www.cnblogs.com/lianliang/p/5327964.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!