lc371. Sum of Two Integers

最新推荐文章于 2025-08-11 22:22:04 发布
最新推荐文章于 2025-08-11 22:22:04 发布
阅读量114 收藏
点赞数
CC 4.0 BY-SA版权
文章标签： python
原文链接：https://juejin.im/post/5cf0c41a6fb9a07efc496f60
博客围绕LeetCode 371题“两整数求和”展开，要求在不使用 + 和 - 运算符的情况下计算两整数之和。给出示例，如输入 a = 1, b = 2 输出 3 等。思路是组合成列表用 sum 函数，代码使用 Python3 实现。

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

371. Sum of Two Integers

Easy

755

1314

Favorite

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

Example 1:

Input: a = 1, b = 2 Output: 3 Example 2:

Input: a = -2, b = 3 Output: 1

思路:组合成list，用sum函数

代码：python3

class Solution:
    def getSum(self, a: int, b: int) -> int:
        return sum([a,b])
复制代码

转载于:https://juejin.im/post/5cf0c41a6fb9a07efc496f60

【leetcode系列】167. 两数之和 II - 输入有序数组
cpongo10的博客～
08-03 188
题目描述这是leetcode头号题目two sum的第二个版本，难度简单。给定一个已按照升序排列的有序数组，找到两个数使得它们相加之和等于目标数。 函数应该返回这两...
371. Sum of Two Integers
guizaijianchic的博客
05-04 262
class Solution(object): def getSum(self, a, b): """ :type a: int :type b: int :rtype: int """ # 32 bits integer max MAX = 0x7FFFFFFF
LC371 Sum of Two Integers
村里的原振侠的博客
09-24 196
Description: Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -. Example 1: Input: a = 1, b = 2 Output: 3 Example 2: Input: a = -2, b = 3 Output: 1 Solution: 妈妈问我为啥跪着写代码！！！ xor：表示不算进位符的两数相加结果(a ^ b) carry : 表示进位符
LC-Sum of Two Integers
不积跬步无以至千里
01-24 216
class Solution(object): def getSum(self, a, b): """ :type a: int :type b: int :rtype: int """ # 32 bits integer max MAX = 0x7FFFFFFF
LC 1. Two Sum
banchao5300的博客
09-30 138
题目介绍 Given an array of integers, returnindicesof the two numbers such that they add up to a specific target. You may assume that each input would haveexactlyone solution, and you may not us...
lc167. Two Sum II - Input array is sorted
weixin_34345560的博客
05-21 131
167. Two Sum II - Input array is sorted Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number. The function twoSum sh...
LC 454. 4Sum II
weixin_30443075的博客
01-12 70
Given four lists A, B, C, D of integer values, compute how many tuples(i, j, k, l)there are such thatA[i] + B[j] + C[k] + D[l]is zero. To make problem a bit easier, all A, B, C, D have same lengt...
LC.02. Add Two Numbers
weixin_34273479的博客
02-23 94
https://leetcode.com/problems/add-two-numbers/description/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...
LC 416. Partition Equal Subset Sum
banchao5300的博客
09-22 110
题目 Given anon-emptyarray containingonly positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal. Note: Each of the ...
LeetCode(java)1. Two Sum
jack_nate的博客
04-06 234
Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution. Example: Given nums =
torch.nn、(二)
weixin_36670529的博客
08-30 3141
目录 Recurrent layers RNN LSTM GRU RNNCell LSTMCell GRUCell Transformer layers Transformer TransformerEncoder TransformerDecoder TransformerEncoderLayer TransformerDecoderLayer Linear laye...
Minimum Sum 完善划分树
cyb6100300115的专栏
03-25 656
Minimum Sum Time Limit: 16000/8000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1152    Accepted Submission(s): 263 Problem Description You are given
RSOME建模入门
XiongPengJohnny的博客
07-14 2438
为了方便处理不同的优化问题，RSOME软件包通过四个程序模块建立不同的建模环境。以下着重介绍ro模块所对应的建模环境及其基本组成部分，如模型对象、变量对象、函数、约束条件等。
redis源码分析之sever.c
小羽毛的博客
05-21 997
#include "server.h" #include "cluster.h" #include "slowlog.h" #include "bio.h" #include "latency.h" #include "atomicvar.h" #include <time.h> #include <signal.h> #include <sys/wait.h&gt...
anaconda 镜像源清华源问题解决
qq_19716091的博客
08-08 690
文件位置‪ C:\Users\用户\.condarc。用清华源时出现的如下图的问题。可以更换为中科大的镜像源。.condarc内容。
WebSocket 在多线程环境下处理 Session并发
TOOZOOY的博客
08-07 1574
WebSocket 在多线程环境下处理 Session并发时，常见问题包括状态冲突（如 IllegalStateException）、消息乱序、连接超时等。以下是综合各技术方案的解决方案，分为单机多线程和分布式集群两类场景：
python之uv使用
Allocator的优快云博客
08-11 728
是一个更现代的python项目管理器.笔者在使用uv前,笔者都是使用anaconda指令(比如) 为每个项目创建隔离的虚拟环境,然后使用激活此环境,最后使用这种方式来安装或者更新项目依赖.而有了uv之后可以让python项目管理变得更加的规范.本文着重讲解笔者最近切换到使用uv进行python项目管理过程中uv的一些常规用法和技巧,后续有用到新的feature会同步更新本文.
动态创建可变对象：Python类工厂函数深度解析
最新发布
钢铁男儿
08-11 516
在Python开发中，我们常遇到需要快速创建简单数据容器的场景。提供了不可变解决方案，但当我们需要可变记录类型时，如何避免重复编写样板代码？本文将揭秘通过类工厂函数动态创建类的核心技术。
Java使用“Microsoft Print To PDF”打印时如何指定输出路径
118路司机的博客
08-11 336
本文介绍了如何通过Java程序动态指定Microsoft Print To PDF虚拟打印机的输出路径。
Write pseudocode for adding two integers in binary expansions formally. Store the two binary integers and their sum in arrays. Illustrate your algorithm using this following two integers: a = (1110) 2 and b = (1011) 2
05-05
Here's an algorithm for adding two binary integers a and b: ``` 1. Initialize carry as 0 2. Initialize index as the length of a and b arrays minus 1 3. Initialize an empty array for the sum 4. While index is greater than or equal to 0: a. Compute the sum of the current bits in a, b, and carry b. If the sum is 0 or 1, append it to the sum array and set carry to 0 c. If the sum is 2, append 0 to the sum array and set carry to 1 d. If the sum is 3, append 1 to the sum array and set carry to 1 e. Decrement index by 1 5. If carry is 1, append it to the sum array 6. Reverse the sum array to get the final result ``` Using the example integers a = (1110) 2 and b = (1011) 2 : ``` a = [1, 1, 1, 0] b = [1, 0, 1, 1] carry = 0 index = 3 sum = [] while index >= 0: current_sum = a[index] + b[index] + carry if current_sum == 0 or current_sum == 1: sum.append(current_sum) carry = 0 elif current_sum == 2: sum.append(0) carry = 1 else: sum.append(1) carry = 1 index -= 1 if carry == 1: sum.append(carry) sum.reverse() result = sum # [1, 1, 1, 0, 1] ``` Therefore, (1110) 2 + (1011) 2 = (11101) 2
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值