10:I[13699,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 11:I[25152,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 12:T46c,import java.util.*; class Solution { public int minOperations(String s, int k) { int n = s.length(), m = 0; for (char c : s.toCharArray()) if (c == '0') m++; int[] dist = new int[n + 1]; Arrays.fill(dist, -1); TreeSet[] nodeSets = new TreeSet[]{new TreeSet<>(), new TreeSet<>()}; for (int i = 0; i <= n; i++) nodeSets[i % 2].add(i); Queue q = new LinkedList<>(); q.offer(m); dist[m] = 0; nodeSets[m % 2].remove(m); while (!q.isEmpty()) { int curr = q.poll(); int c1 = Math.max(k - n + curr, 0), c2 = Math.min(curr, k); int lnode = curr + k - 2 * c2, rnode = curr + k - 2 * c1; int parity = lnode % 2; SortedSet sub = nodeSets[parity].subSet(lnode, true, rnode, true); List toRemove = new ArrayList<>(sub); for (int m2 : toRemove) { dist[m2] = dist[curr] + 1; q.offer(m2); nodeSets[parity].remove(m2); } } return dist[0]; } }13:T42f,#include #include #include #include #include using namespace std; class Solution { public: int minOperations(string s, int k) { int n = s.length(), m = 0; for (char c : s) if (c == '0') m++; vector dist(n + 1, -1); set nodeSets[2]; for (int i = 0; i <= n; i++) nodeSets[i % 2].insert(i); queue q; q.push(m); dist[m] = 0; nodeSets[m % 2].erase(m); while (!q.empty()) { int curr = q.front(); q.pop(); int c1 = max(k - n + curr, 0), c2 = min(curr, k); int lnode = curr + k - 2 * c2, rnode = curr + k - 2 * c1; int parity = lnode % 2; auto it = nodeSets[parity].lower_bound(lnode); while (it != nodeSets[parity].end() && *it <= rnode) { int m2 = *it; dist[m2] = dist[curr] + 1; q.push(m2); it = nodeSets[parity].erase(it); } } return dist[0]; } };

Time Complexity

Space Complexity