Python (Simple Maths)
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def maximumBinaryString(self, binary):\n        n, count = len(binary), 0\n\n        ans = ["1"]*n\n\n        for i in range(n):\n            if binary[i] == "0":\n                count += 1 \n\n        for i in range(n):\n            if binary[i] == "0":\n                ans[i+count-1] = "0"\n                return "".join(ans)\n\n        return binary\n```
['Python3']