Given two binary strings, return their sum (also a binary string).

For example,
a = "11"
b = "1"
Return "100".

这个题目只要注意各种情况你就成功了一大半，特别要注意的是对进位赋值后可能产生的变化，以及最后一位进位为1时，

我们要把这个1插进来。同时注意字符串的低位是我们数值的高位

class Solution {

public:

    string addBinary(string a, string b) {

        reverse(begin(a), end(a));

        reverse(begin(b), end(b));

        string result;

        char num = '';

        int i = ;

        for (;i < a.size() && i < b.size();++i)

        {

            if (a[i] == ''&&b[i] == ''&&num == '')

            {

                result.insert(begin(result), '');

            }

            if (a[i] == ''&&b[i] == ''&&num == '')

            {

                result.insert(begin(result), '');

            }

            if ((a[i] == ''&&b[i] == ''&&num == '') || (a[i] == ''&&b[i] == ''&&num == '') ||

                (a[i] == ''&&b[i] == ''&&num == ''))

            {

                result.insert(begin(result), '');

                num = '';

            }

            if (a[i] == ''&&b[i] == ''&&num == '' || a[i] == ''&&b[i] == ''&&num == '' ||

                a[i] == ''&&b[i] == ''&&num == '')

            {

                result.insert(begin(result), '');

                num = '';

            }

        }

        if (i == a.size())

        {

            for (;i < b.size();++i)

            {

                if (b[i] == ''&&num == '')

                    result.insert(begin(result), '');

                if (b[i] == ''&&num == '' || b[i] == ''&&num == '')

                {

                    result.insert(begin(result), '');

                    num = '';

                }

                if (b[i] == ''&&num == '')

                    result.insert(begin(result), '');

            }

        }

        else

        {

            for (;i < a.size();++i)

            {

                if (a[i] == ''&&num == '')

                    result.insert(begin(result), '');

                if (a[i] == ''&&num == '')

                    result.insert(begin(result), '');

                if (a[i] == ''&&num == '' || a[i] == ''&&num == '')

                {

                    result.insert(begin(result), '');

                    num = '';

                }

            }

        }

        if (num == '')result.insert(begin(result), '');

        return result;

    }

};

LeetCode 67. Add Binary的更多相关文章

  1. LeetCode 67. Add Binary （二进制相加）

    Given two binary strings, return their sum (also a binary string). For example,a = "11"b = ...

  2. [LeetCode] 67. Add Binary 二进制数相加

    Given two binary strings, return their sum (also a binary string). The input strings are both non-em ...

  3. Java [Leetcode 67]Add Binary

    题目描述: Given two binary strings, return their sum (also a binary string). For example,a = "11&qu ...

  4. (String) leetcode 67. Add Binary

    Given two binary strings, return their sum (also a binary string). The input strings are both non-em ...

  5. [leetcode]67. Add Binary 二进制加法

    Given two binary strings, return their sum (also a binary string). The input strings are both non-em ...

  6. LeetCode - 67. Add Binary(4ms)

    Given two binary strings, return their sum (also a binary string). The input strings are both non-em ...

  7. leetcode 67. Add Binary （高精度加法）

    Given two binary strings, return their sum (also a binary string). For example,a = "11"b = ...

  8. LeetCode 67 Add Binary（二进制相加）（*）

    翻译 给定两个二进制字符串,返回它们的和(也是二进制字符串). 比如, a = "11" b = "1" 返回 "100". 原文 Give ...

  9. leetCode 67.Add Binary (二进制加法) 解题思路和方法

    Given two binary strings, return their sum (also a binary string). For example, a = "11" b ...

随机推荐

  1. 导入和导出表空间：复制文件比mysqldump&restore快

    #生成测试数据server1:mysql> CREATE TABLE test (c1 INT PRIMARY KEY)engine = innodb;Query OK, 0 rows affe ...

  2. [转]PO和VO、关于延迟加载（lazy）和强制加载（Hibernate.initialize(Object proxy) )

    摘自http://www.cnblogs.com/kelin1314/archive/2009/11/13/1602778.html PO和VO PO 即Persistence Object VO 即 ...

  3. (转)Edge实现NodeJS与.NET互操作(包括UI界面示例)

    本文转载自:http://blog.csdn.net/kimmking/article/details/42708049 1.  Edge是什么 Edge是一种在进程内实现NodeJS与.NET互操作 ...

  4. 【转】双机高可用、负载均衡、MySQL(读写分离、主从自动切换)架构设计

    架构简介 前几天网友来信说帮忙实现这样一个架构:只有两台机器,需要实现其中一台死机之后另一台能接管这台机器的服务,并且在两台机器正常服务时,两台机器都能用上.于是设计了如下的架构.此架构主要是由kee ...

  5. android学习笔记19——对话框(DatePickerDialog、TimePickerDialog)

    DatePickerDialog.TimePickerDialog ==> DatePickerDialog.TimePickerDialog功能.用法都比较简单,操作步骤: 1.通过new关键 ...

  6. 浅析:setsockopt()改善socket网络程序的健壮性

    1. 如果在已经处于 ESTABLISHED状态下的socket(一般由端口号和标志符区分)调用closesocket(一般不会立即关闭而经历TIME_WAIT的过程)后想继续重用该socket:BO ...

  7. 安装ORACLE后，改变计算机名称，导致OracleDBConsoleOrcl服务无法启动

    错误信息: 启动oracledbconsoleorcl 服务提示 -- “--Windows不能再本地计算机启动oracledbconsoleorcl  有关更多信息,查阅系统事件日志,如果这是非Mi ...

  8. Perl 模块 Getopt::Std 和 Getopt::Long

    示例程序: getopt.pl; 1 2 3 4 5 6 7 8 #!/usr/bin/perl -w #use strict; use Getopt::Std; use vars qw($opt_a ...

  9. VisualStudio 调试不提示调试错误

    尝试办法: 1.工具->选项->调试->启用异常助手;2.调试->异常; 解决办法: 把2.调试->异常; 下地全部钩上异常就弹出来了

  10. Objective-C语法汇总

    1.方法前的加减号 Objective-C中是没有public与private的概念的,即可以认为全部都是public.减号表示的是一个函数.方法.消息的开始.加号则表示不需要创建一个类的实例,其他类 ...