题目:http://oj.leetcode.com/problems/add-two-numbers/
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
题目翻译:
给定两个链表表示两个非负数。数字逆序存储,每个节点包含一个单一的数字。计算两个数的和,并以链表的形式返还。
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ public class Solution { public ListNode addTwoNumbers(ListNode l1, ListNode l2) { ListNode head = null; ListNode res = null; int a = 0; while (l1!=null || l2!=null) { int sum = a; if (l1!=null) { sum += l1.val; l1 = l1.next; } if (l2!=null) { sum += l2.val; l2 = l2.next; } if (sum/10 > 0) { a = 1; } else { a = 0; } sum = sum%10; ListNode tmp = new ListNode(sum); if (res == null) { head = tmp; } else { res.next = tmp; } res = tmp; } if (a == 1) { ListNode tmp = new ListNode(1); res.next = tmp; } return head; } }
/** * Definition for singly-linked list. * function ListNode(val) { * this.val = val; * this.next = null; * } */ /** * @param {ListNode} l1 * @param {ListNode} l2 * @return {ListNode} */ var addTwoNumbers = function(l1, l2) { var head, res, a = 0; while (l1 || l2) { var sum = a; if (l1) { sum += l1.val l1 = l1.next; } if (l2) { sum += l2.val l2 = l2.next; } if (sum >= 10) { a = 1; } else { a = 0; } sum = sum % 10; var tmp = new ListNode(sum); if (res === undefined) { head = tmp; } else { res.next = tmp; } res = tmp; } if (a === 1) { tmp = new ListNode(a); res.next = tmp; } return head; };
相关推荐
You are given two non-empty linked lists ... 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. java AC版本
leetcode:Add Two Numbers(java)
手绘算法力扣 2 两数相加(Add Two Numbers)
python python_leetcode面试题解之两数相加AddTwoNumbers
自己写的一个完整的程序,包括main函数,在VS上面提交通过,但是放到leetcode上面会出现问题;只是作为一个参考,一起学习学习0.o!解决的问题有:第一:两个链表的最后一个值相加后进位的问题;...
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. Input: (2 -> 4 -> 3) + (5 -> 6 -> 4) Output: 7 -> 0 ...
给你两个?非空 的链表,表示两个非负的整数。它们每位数字都是按照?逆序?的方式存储的,并且每个节点只能存储?一位?数字。请你将两个数相加,并以相同形式返回一个表示和的链表。你可以假设除了数字 0 之外,这两个...
js代码-2. Add Two Numbers
leetcode leetcode练习 twosum 问题 ;add two numbers问题;reverse integer问题;最大不重复子字符串长度问题;atoi问题;
leetcode 2 和 c 2021-LeetCode-02_Add_...addTwoNumbers(_ l1: ListNode?, _ l2: ListNode?) -> ListNode? { guard l1 != nil && l2 != nil else { return nil } var resultTail = ListNode() let resultHead = resu
# Definition for singly-linked list. class ListNode: def __init__(self, x): self.val = x self.next = None #Use listnode to get a decimal number class GetNum: snode = None num = 0 ...
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. Input: (2 -> 4 -> 3) + (5 -> 6 -> 4) Output: 7 -> 0 ...
2. Add Two Numbers 3. Longest Substring Without Repeating Characters 4. Median of Two Sorted Arrays 7. Reverse Integer 9. Palindrome Number 11. Container With Most Water 13. Roman to Integer 15. 3Sum ...
Add two numbers without using arithmetic operators Chapter 10. Given an array of integers where all the numbers are appearing twice find the only number which appears once Chapter 11. Given an array ...
挑战:01-addOne 难度:基本Swift的: 编写一个名... 例子: addTwoNumbers(5,10)-> 15 addTwoNumbers(10,-2)-> 8 addTwoNumbers(0,0)-> 0 addTwoNumbers('Hello',5)-> NaN function addTwoNumbers ( num1
421 | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/) | [C++](./C++/maximum-xor-of-two-numbers-in-an-array.cpp) [Python](./Python/...
add two numbers in java
Java Program To Add Two Numbers
节点jsat ... * @deprecated addTwoNumbers() will be removed in v2.0.0; please use add() */ exports . addTwoNumbers ( firstNumber , secondNumber ) { return firstNumber + secondNumber ; }