2. Add Two Numbers 【Medium】

avatar 2020年08月29日14:30:57 6 2661 views
博主分享免费Java教学视频,B站账号:Java刘哥 ,长期提供技术问题解决、项目定制:本站商品点此

Question

You 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.

Example:

  1. Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
  2. Output: 7 -> 0 -> 8
  3. Explanation: 342 + 465 = 807.

My Answer

  1. /**
  2. * Definition for singly-linked list.
  3. * public class ListNode {
  4. * int val;
  5. * ListNode next;
  6. * ListNode() {}
  7. * ListNode(int val) { this.val = val; }
  8. * ListNode(int val, ListNode next) { this.val = val; this.next = next; }
  9. * }
  10. */
  11. class Solution {
  12. public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
  13. ListNode c1 = l1;
  14. ListNode c2 = l2;
  15. ListNode head = new ListNode(0); // 虚拟头结点
  16. ListNode curr = head;
  17. int carry = 0;
  18. while(c1 != null || c2 != null) {
  19. int x = (c1 != null) ? c1.val : 0;
  20. int y = (c2 != null) ? c2.val : 0;
  21. int sum = carry + x + y;
  22. carry = sum / 10;
  23. curr.next = new ListNode(sum % 10);
  24. curr = curr.next;
  25. if(c1 != null) {
  26. c1 = c1.next;
  27. }
  28. if(c2 != null) {
  29. c2 = c2.next;
  30. }
  31. }
  32. // 解决最后一个结点之间的相加进位的情况
  33. if(carry > 0) {
  34. curr.next = new ListNode(carry);
  35. }
  36. return head.next;
  37. }
  38. }
  • 微信
  • 交流学习,资料分享
  • weinxin
  • 个人淘宝
  • 店铺名:言曌博客咨询部

  • (部分商品未及时上架淘宝)
avatar

发表评论

avatar 登录者:匿名
匿名评论,评论回复后会有邮件通知

  

已通过评论:0   待审核评论数:0