371. Sum of Two Integers

371. Sum of Two Integers

Leetcode link for this question

Discription:

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.

Analyze:

Since no operator + and - to use, we can use bit operation and shift operation to constitute sum rules.
To caculate 7+6

a,b=7,6
print 'a =',bin(a)
print 'b =',bin(b)
print 'a^b =',bin(a^b)
print 'a&b =',bin(a&b)

a = 0b111
b = 0b110
a^b = 0b1
a&b = 0b110

a+b=7+6 = 0b 111+0b 110 = 0b 1101 =0b 1100 + 0b0001 = (0b 111&0b 110) + A left shift to (0b 111^0b 110) = left shift(a&b)+a^b
when a&b is 0, a+b=a^b.

Code 1:

class Solution(object):       
    def getSum(self, a, b):
        """
        :type a: int
        :type b: int
        :rtype: int
        """
        def fun(a,b):
            sum=a^b           #    the sum ignore carry
            carry=a&b         #    
            if (carry==0):
                return sum
            else:
                return fun(sum,carry<<1)

        flag=1
        if(a^b<0):
            if(a==-b):
                return 0
            elif(a<0):
                if(-a<b):
                    flag=-1
            elif(a>-b):
                flag=-1
        if(flag==-1):
            a=-a;b=-b
        return flag*fun(a,b)

Submission Result:

Status: Accepted
Runtime: 36 ms
Ranking: beats 96.23%

I don’t know why positive plus negative will get wrong anser using python bit operation.

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值