C++ Greedy
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 {\npublic:\n    string maximumBinaryString(string binary) {\n        int n = binary.size();\n        int cnt=0,k=-1; \n        for(int i = 0; i < n; i++)\n        {\n            if(binary[i]==\'0\'){\n            if(k==-1)\n                k= i;\n            else\n                cnt++;\n            }\n        }\n        for(int i = 0; i < n; i++)\n        {\n            if((k+cnt)== i)\n                binary[i] = \'0\';\n            else\n                binary[i] = \'1\';\n        }\n        return binary;\n    }\n};\n```
['C++']