Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
33 lines (31 loc) · 882 Bytes

File metadata and controls

33 lines (31 loc) · 882 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
/*
Author: King, wangjingui@outlook.com
Date: Dec 12, 2014
Problem: Add Binary
Difficulty: Easy
Source: https://oj.leetcode.com/problems/add-binary/
Notes:
Given two binary strings, return their sum (also a binary string).
For example,
a = "11"
b = "1"
Return "100".
Solution: '1'-'0' = 1.
*/
public class Solution {
public String addBinary(String a, String b) {
StringBuffer res = new StringBuffer();
int N = a.length(), M = b.length();
int i = N - 1, j = M - 1;
int carry = 0;
while (i>=0 || j>=0) {
int sum = carry;
if (i >= 0) sum += a.charAt(i--) - '0';
if (j >= 0) sum += b.charAt(j--) - '0';
carry = sum / 2;
res.insert(0,String.valueOf(sum % 2));
}
if (carry == 1) res.insert(0,'1');
return res.toString();
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.