题目

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

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

代码

public class Solution {public  String addBinary(String a, String b) {String lon= a.length()-b.length()>=0 ? a:b;String sho= a.length()-b.length()<0 ? a:b;char[] lon_char=lon.toCharArray();char[] sho_char=sho.toCharArray();char temp='0';int final_length=lon.length()-1;int index=0;String[] str=new String[lon.length()+1];String addBinary_str="";for(int i=0;i<sho.length();i++){String temp_s=String.valueOf(temp);String sho_char_s=String.valueOf(sho_char[sho.length()-1-i]);String lon_char_s=String.valueOf(lon_char[lon.length()-1-i]);switch(Integer.parseInt(temp_s)+Integer.parseInt(sho_char_s)+Integer.parseInt(lon_char_s)){ case 0:temp='0';str[index++]="0";break;case 1:temp='0';str[index++]="1";break;case 2:temp='1';str[index++]="0";break;case 3:temp='1';str[index++]="1";break;}}while(index<lon.length()){String temp_s=String.valueOf(temp);String lon_char_s=String.valueOf(lon_char[lon.length()-index-1]);switch(Integer.parseInt(temp_s)+Integer.parseInt(lon_char_s)){ case 0:temp='0';str[index++]="0";break;case 1:temp='0';str[index++]="1";break;case 2:temp='1';str[index++]="0";break;}}if(temp=='1'){str[lon.length()]="1";final_length=lon.length();}for(int k=final_length;k>=0;k--){addBinary_str+=str[k];}return addBinary_str;}}

代码下载：https://github.com/jimenbian/GarvinLeetCode

/********************************

* 本文来自博客 “李博Garvin“

* 转载请标明出处:http://blog.csdn.net/buptgshengod

******************************************/

【LeetCode从零单排】No67.AddBinary相关推荐

【LeetCode从零单排】No198.House Robber No91.Decode Ways139 word break（动态规划典型应用）
1.题目一道典型的Dynamic Programming的题目. You are a professional robber planning to rob houses along a stree ...
【LeetCode从零单排】No70.ClimbingStairs
题目爬楼梯问题,这是一道很有趣的问题.首先看题目: You are climbing a stair case. It takes n steps to reach to the top. Each ...
【LeetCode从零单排】No26.Remove Duplicates from Sorted Array
题目题目要求:去除sort int数组中的重复项. Given a sorted array, remove the duplicates in place such that each ...
【LeetCode从零单排】No.7 Reverse Integer
前话今天开始励志刷一下leetcode上面的题目(还好这个网站没被TG和谐).从easy的开始,数一下差不多有40道,争取两个月搞定. 题目没想到做的第一道题目,虽然看似 ...
【LeetCode从零单排】No.135Candy(双向动态规划)
1.题目 There are N children standing in a line. Each child is assigned a rating value. You are giving ...
【LeetCode从零单排】No22.Generate Parentheses
题目 Given n pairs of parentheses, write a function to generate all combinations of well-formed parent ...
【LeetCode从零单排】No221.Maximal Square
题目 Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and ...
【LeetCode从零单排】No133. clon graph (BFS广度优先搜索)
背景 (以下背景资料转载自:http://www.cnblogs.com/springfor/p/3874591.html?utm_source=tuicool) DFS(Dpeth-first Se ...
【LeetCode从零单排】No121 Best Time to Buy and Sell Stock
题目 Say you have an array for which the ith element is the price of a given stock on day i. If you we ...

【LeetCode从零单排】No67.AddBinary

题目

代码

【LeetCode从零单排】No67.AddBinary相关推荐

最新文章

热门文章