René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"67.二进制求和","articleBody":"[原题地址: 67. 二进制求和](https://leetcode-cn.com/problems/add-binary/)\r\n\r\n#### 解法\r\n模拟算盘加法，逐位相加即可\r\n\r\n#### 代码\r\n```js\r\n/**\r\n * @param {string} a\r\n * @param {string} b\r\n * @return {string}\r\n */\r\nvar addBinary = function(a, b) {\r\n  // 字符串翻转\r\n  a = a.split('').reverse().join('')\r\n  b = b.split('').reverse().join('')\r\n\r\n  // 保证a的长度大于b的长度\r\n  if (a.length \u003c b.length) {\r\n    [a, b] = [b, a]\r\n  }\r\n\r\n  let res = ''\r\n  let carry = 0 // 进位\r\n\r\n  // 模拟逐位加法\r\n  for(let i = 0; i \u003c a.length; i++) {\r\n    let term = parseInt(a[i]) + parseInt(b[i] || 0) + carry\r\n    carry = parseInt(term / 2)\r\n    term = term % 2\r\n    res = `${term}${res}`\r\n  }\r\n\r\n  // 如果最后计算完还有进位的边界处理\r\n  if (carry \u003e 0) {\r\n    res = `${carry}${res}`\r\n  }\r\n\r\n  return res;\r\n};\r\n```","author":{"url":"https://github.com/feikerwu","@type":"Person","name":"feikerwu"},"datePublished":"2020-02-25T09:43:38.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":0},"url":"https://github.com/1/algorithm-camp/issues/1"}