Just count the number of zeros from right
python:\n\n\tclass Solution:\n\t\tdef minimumSteps(self, s: str) -> int:\n\t\t\tzero,res = 0,0\n\t\t\tfor i in range(len(s)-1,-1,-1):\n\t\t\t\tif s[i]==\'1\':re
python:\n\n\tclass Solution:\n\t\tdef minimumSteps(self, s: str) -> int:\n\t\t\tzero,res = 0,0\n\t\t\tfor i in range(len(s)-1,-1,-1):\n\t\t\t\tif s[i]==\'1\':res += zero \n\t\t\t\telse: zero += 1 \n\t\t\treturn res\n\t\t\t\nJava:\n\n\t\tint zero = 0, res = 0;\n\t\tfor (int i = s.length() - 1; i >= 0; i--) {\n\t\t\tif (s.charAt(i) == \'1\') {\n\t\t\t\tres += zero;\n\t\t\t} else {\n\t\t\t\tzero += 1;\n\t\t\t}\n\t\t}\n\t\treturn res;\n
['Python', 'Java']