CODE 67: Add Binary

最新推荐文章于 2024-12-17 14:17:09 发布

原创最新推荐文章于 2024-12-17 14:17:09 发布 · 618 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

154 篇文章

订阅专栏

本文介绍了一种方法，用于将两个二进制字符串相加并返回结果的二进制字符串形式。通过逐位比较输入字符串，并使用进位机制来处理溢出情况，实现了高效的字符串加法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

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

	public String addBinary(String a, String b) {
		// Note: The Solution object is instantiated only once and is reused by
		// each test case.
		char[] as = a.toCharArray();
		char[] bs = b.toCharArray();
		int i = as.length - 1;
		int j = bs.length - 1;
		int c = 0;
		StringBuilder sb = new StringBuilder();
		while (i >= 0 && j >= 0) {
			if (0 == c) {
				if ((as[i] == '0' && bs[j] == '1')
						|| (as[i] == '1' && bs[j] == '0')) {
					sb = sb.insert(0, '1');
					c = 0;
				} else if ((as[i] == '0' && bs[j] == '0')) {
					sb = sb.insert(0, '0');
					c = 0;
				} else {
					sb = sb.insert(0, '0');
					c = 1;
				}
			} else if (1 == c) {
				if ((as[i] == '0' && bs[j] == '1')
						|| (as[i] == '1' && bs[j] == '0')) {
					sb = sb.insert(0, '0');
					c = 1;
				} else if ((as[i] == '0' && bs[j] == '0')) {
					sb = sb.insert(0, '1');
					c = 0;
				} else {
					sb = sb.insert(0, '1');
					c = 1;
				}
			}
			i--;
			j--;
		}
		while (i >= 0) {
			if (0 == c) {
				sb = sb.insert(0, as[i]);
				c = 0;

			} else if (1 == c) {
				if (as[i] == '0') {
					sb = sb.insert(0, '1');
					c = 0;
				} else {
					sb = sb.insert(0, '0');
					c = 1;
				}
			}
			i--;
		}
		while (j >= 0) {
			if (0 == c) {
				sb = sb.insert(0, bs[j]);
				c = 0;

			} else if (1 == c) {
				if (bs[j] == '0') {
					sb = sb.insert(0, '1');
					c = 0;
				} else {
					sb = sb.insert(0, '0');
					c = 1;
				}
			}
			j--;
		}
		if (1 == c) {
			sb = sb.insert(0, '1');
		}
		return sb.toString();
	}