Time: 56 ms (70.06%), Space: 18.1 MB (54.49%) - LeetHub

Author: hogan-tech

3493-maximum-number-of-operations-to-move-ones-to-the-end/3493-maximum-number-of-operations-to-move-ones-to-the-end.py

@@ -0,0 +1,19 @@
+# time complexity: O(n)
+# space complexity: O(1)
+
+class Solution:
+    def maxOperations(self, s: str) -> int:
+        count = 0
+        result = 0
+        for i, c in enumerate(s):
+            if c == '1':
+                count += 1
+            elif i > 0 and s[i - 1] == '1':
+                result += count
+        return result
+
+
+s = "1001101"
+print(Solution().maxOperations(s))
+s = "00111"
+print(Solution().maxOperations(s))