中级农民
- 积分
- 112
- 大米
- 颗
- 鳄梨
- 个
- 水井
- 尺
- 蓝莓
- 颗
- 萝卜
- 根
- 小米
- 粒
- 学分
- 个
- 注册时间
- 2012-7-19
- 最后登录
- 1970-1-1
|
贴自己的代码以供大家参考,欢迎指正!- def bcdOpt(a, b):
- x = binary(a)
- y = binary(b)
- n = addBinary(x, y)
- if compare(n, [1,0,0,1]) == 1:
- return addBinary(n, [0,1,1,0])[-4:]
- return n
-
- def binary(n):
- res = []
- while n > 0:
- res.insert(0, n % 2)
- n /= 2
- return res
- def addBinary(x, y):
- i, j = len(x) - 1, len(y) - 1
- res = []
- carry = 0
- while i >= 0 or j >= 0:
- m = x[i] if i >= 0 else 0
- n = y[j] if j >= 0 else 0
- sum = m + n + carry
- res.insert(0, sum % 2)
- carry = sum / 2
- i -= 1
- j -= 1
- if carry == 1:
- res.insert(0, 1)
- return res
- def compare(x, y):
- """
- return 1: x > y
- return 0: x == y
- return -1: x < y
- """
- if len(x) > len(y):
- return 1
- elif len(x) < len(y):
- return -1
- else:
- for i in range(len(x)):
- if x[i] > y[i]:
- return 1
- elif x[i] < y[i]:
- return -1
- return 0
复制代码 |
|