René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/maximum-binary-string-after-change","name":"#1702 - Maximum Binary String After Change - LeetCode JavaScript Solutions","description":"You are given a binary string binary consisting of only 0's or 1's. You can apply each of the following operations any number of t...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {string} binary\n * @return {string}\n */\nvar maximumBinaryString = function(binary) {\n  const n = binary.length;\n  let zeroCount = 0;\n  let firstZero = -1;\n\n  for (let i = 0; i < n; i++) {\n    if (binary[i] === '0') {\n      if (firstZero === -1) firstZero = i;\n      zeroCount++;\n    }\n  }\n\n  if (zeroCount <= 1) return binary;\n\n  const result = new Array(n).fill('1');\n  result[firstZero + zeroCount - 1] = '0';\n\n  return result.join('');\n};","keywords":"LeetCode 1702, #1702 - Maximum Binary String After Change, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}