[LeetCode]371. Sum of Two Integers【&2. Add Two Numbers】

最新推荐文章于 2025-08-12 12:49:47 发布

InfoSecPractitioner

最新推荐文章于 2025-08-12 12:49:47 发布

阅读量220

点赞数

分类专栏： leetcode 文章标签： leetcode

leetcode 专栏收录该内容

64 篇文章

订阅专栏

本文介绍了两种不常规的加法实现方法：一种是在不使用+和-运算符的情况下计算两个整数的和；另一种是将两个表示非负整数的链表相加并返回新的链表。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

371 . Sum of Two Integers
Easy

Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -.

Example:
Given a = 1 and b = 2, return 3.

0ms:

 public int getSum(int a, int b) {
        int re = a^b;
        int jin = (a&b)<<1;
        if(jin!=0) return getSum(re,jin);
        return re;
    }

2 . Add Two Numbers
Medium

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