You are given two non-empty linked lists that represent non-negative integers. The nodes of each list contain a single digit, in reverse order of the most significant digit. Add the two numbers and return the sum as a linked list.

You are given two non-empty linked lists that represent non-negative integers. The nodes of each list contain a single digit, in reverse order of the most significant digit. Add the two numbers and return the sum as a linked list.

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: easy

标签: interviewbit, virtusa, company-specific

目标公司: Virtusa

参考答案摘要

class Solution { private int val = 0; private int carry = 0; //This method reverse the linked list. private ListNode reverse(ListNode head){ if(head == null || head.next == null) return head; ListNode...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案、收藏题目并进行模拟面试练习。