Add Binary leetcode
2016-01-07 19:59
239 查看
Given two binary strings, return their sum (also a binary string).
For example,
a =
b =
Return
Subscribe to see which companies asked this question
二进制string加法,可优化代码,不过算法已经接近最优
For example,
a =
"11"
b =
"1"
Return
"100".
Subscribe to see which companies asked this question
二进制string加法,可优化代码,不过算法已经接近最优
string addBinary(string a, string b) { string ret; int lenA = a.size() - 1; int lenB = b.size() - 1; int cur; int add = 0; while (lenA >= 0 || lenB >= 0) { int numA = lenA >= 0 ? a[lenA] - '0' : 0; int numB = lenB >= 0 ? b[lenB] - '0' : 0; int num = numA + numB + add; cur = num & 1; add = num >> 1; ret.insert(0, 1, char('0' + cur)); lenA--; lenB--; } if (add == 1) ret.insert(0, 1, '1'); return ret; }
相关文章推荐
- Struts中Ognl语法注意事项
- Thrift框架学习整理
- POJ-2081 Terrible Sets(暴力,单调栈)
- 堆和栈
- POJ-2081 Terrible Sets(暴力,单调栈)
- css3-多列
- 读取年份数组中的所有周六周天
- 质数因子
- 如何将一块物理网卡分配给一台VMWare虚拟机(VMWare ESXi 5.0)
- TLD for android 移植问题
- USRP配置与测试
- SQL Server中开发常用的数据类型
- Java开发淘宝订单系统
- Ubuntu sudo的使用
- reason: '*** Collection <__NSCFArray: 0x7ffa43528f70> was mutated while being enumerated.'
- java基础-常用类(API)
- POJ-2181 Jumping Cows(贪心)
- instancetype和id的区别
- POJ-2181 Jumping Cows(贪心)
- sretcarahCgnitaepeRtuohtiWgnirtsbuStsegnoL.3