leetcode002 给定两个链表,计算他们的和,链表是逆序的。
给出两个 非空 的链表用来表示两个非负的整数。其中,它们各自的位数是按照 逆序 的方式存储的,并且它们的每个节点只能存储 一位 数字。如果,我们将这两个数相加起来,则会返回一个新的链表来表示它们的和。您可以假设除了数字 0 之外,这两个数都不会以 0 开头。示例:
输入:(2 -> 4 -> 3) + (5 -> 6 -> 4)
输出:7 -> 0 -> 8
原因:342 + 465 = 807
class ListNode:
def __init__(self, x):
self.val = x
self.next = None
def __repr__(self):
# for debugging
return repr(self.val)
class Solution:
def addTwoNumbers(self,l1,l2):
result_head = ListNode(0)
cur1 = l1
cur2 = l2
cur = result_head
while cur1 or cur2:
cur.val = cur.val + self.addNode(cur1,cur2)
if cur.val < 10:
if cur1 and cur1.next or cur2 and cur2.next:
cur.next = ListNode(0)
else:
cur.val -= 10
cur.next = ListNode(1)
if cur1:
cur1 = cur1.next
if cur2:
cur2 = cur2.next
cur = cur.next
return result_head
def addNode(self,l1,l2):
if not l1 and not l2:
raise Exception('two node are None')
if not l1:
return l2.val
if not l2:
return l1.val
return l1.val + l2.val
leetcode 67 addbinary
""""
定两个二进制字符串,返回他们的和(用二进制表示)。
输入为非空字符串且只包含数字 1 和 0。
示例 1:
输入: a = "11", b = "1"
输出: "100"
示例 2:
输入: a = "1010", b = "1011"
输出: "10101"
"""
class Solution(object):
def addBinary(self, a, b):
"""
:type a: str
:type b: str
:rtype: str
"""
if len(a)>len(b):
a, b = b, a
a, b = list(a), list(b)
# from LSB to MSB
a.reverse()
b.reverse()
# b as the base number
for i in range(len(a)):
if a[i]=="0": # 0
continue
elif b[i]=="0": # 0+1
b[i] = "1"
continue
else: # 1+1
b[i] = "0"
# carry forward
if i==len(b)-1:
b.append("1")
else:
for j in range(i+1, len(b)):
if b[j]=="0":
b[j] = "1"
break
else:
b[j] = "0" # carry forward
if j==len(b)-1:
b.append("1")
break
b.reverse()
return "".join(b) # reversed back
class Solution2(object):
def addBinary(self, a, b):
return bin(int(a, 2) + int(b, 2))[2:]
class Solution3(object):
def addBinary(self, a, b):
if a==b=="0":
return "0"
num1=num2=0
for i,x in enumerate(a):
num1+=int(x)*(2**(len(a)-i-1))
for i,x in enumerate(b):
num2+=int(x)*(2**(len(b)-i-1))
num=num1+num2
numss=""
while num>1:
nums=num%2
numss+=str(nums)
num=num//2
numss+="1"
return numss[::-1]