Commitf47cbc0

authored

Merge pull requestJack-Lee-Hiter#1 from Sen1992/Sen1992-patch-1

Update 不用加减乘除做加法.py

2 parentsf1b9f60 +ae60086 commitf47cbc0Copy full SHA for f47cbc0

File tree

+19

-8

lines changed

+19

-8

lines changed

Lines changed: 19 additions & 8 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,13 +6,24 @@`
`6`	`6`	`# 可能是python的的整型可以无限大的原因, 导致正数和负数的异或操作不断变成更小的负数而不会溢出`
`7`	`7`	`# 使用Swift尝试了一下, 还是可以求得正数和负数的位操作相加运算的`
`8`	`8`	`# -- coding:utf-8 --`
	`9`	`+# class Solution:`
	`10`	`+# def Add(self, num1, num2):`
	`11`	`+# while num2:`
	`12`	`+# sum = num1 ^ num2`
	`13`	`+# carry = (num1 & num2) << 1`
	`14`	`+# num1 = sum`
	`15`	`+# num2 = carry`
	`16`	`+# return num1`
	`17`	`+# s = Solution()`
	`18`	`+# print(s.Add(4, 2))`
	`19`	`+# -- coding:utf-8 --`
	`20`	`+# 通过每次对num1进行与操作保证是一个32位的整形`
	`21`	`+# 因此最后我们可以判断符号位是否为1做处理`
`9`	`22`	`classSolution:`
`10`	`23`	`defAdd(self,num1,num2):`
`11`		`-whilenum2:`
`12`		`-sum=num1^num2`
`13`		`-carry= (num1&num2)<<1`
`14`		`-num1=sum`
`15`		`-num2=carry`
`16`		`-returnnum1`
`17`		`-s=Solution()`
`18`		`-print(s.Add(4,2))`
	`24`	`+# write code here`
	`25`	`+whilenum2!=0:`
	`26`	`+temp=num1^num2`
	`27`	`+num2= (num1&num2)<<1`
	`28`	`+num1=temp&0xFFFFFFFF`
	`29`	`+returnnum1ifnum1>>31==0elsenum1-4294967296`

Comments

(0)