Add Two Numbers Algorithm
The Add Two Numbers Algorithm is a simple and fundamental algorithm used in computer programming and mathematics to calculate the sum of two given numbers. This algorithm forms the basis of arithmetic operations in programming languages and is an essential concept for any programmer or mathematician to understand. The addition of two numbers can be performed in various ways, such as using an iterative loop, employing bitwise operations, or through recursion. Regardless of the method, the primary objective of the algorithm remains the same - to find the sum of two input numbers and return the result.
In the context of programming, the Add Two Numbers Algorithm can be implemented in any programming language, such as Python, C++, or Java, using basic arithmetic operators like the "+" sign. The algorithm takes two input numbers (integers or floating-point numbers) and adds them together to produce the output, which is their sum. The efficiency of this algorithm is generally high due to its simplicity, and it forms the foundation for more complex mathematical operations and algorithms. In real-world applications, this algorithm is used in a wide range of fields, including finance, engineering, and data analytics, where the addition of numerical values is a common requirement.
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int carry = 0;
ListNode *list = new ListNode(0);
ListNode *head = list;
ListNode *prev = list;
while (l1 && l2) {
carry += l1->val + l2->val;
list = new ListNode(0);
list->val = carry % 10;
carry /= 10;
l1 = l1->next;
l2 = l2->next;
prev->next = list;
prev = prev->next;
}
while (l1) {
carry += l1->val;
list = new ListNode(0);
list->val = carry % 10;
carry /= 10;
l1 = l1->next;
prev->next = list;
prev = prev->next;
}
while (l2) {
carry += l2->val;
list = new ListNode(0);
list->val = carry % 10;
carry /= 10;
l2 = l2->next;
prev->next = list;
prev = prev->next;
}
if (carry) {
list = new ListNode(0);
list->val = carry;
prev->next = list;
prev = prev->next;
}
return head->next;
}
};
