10:I[13699,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/cb0f98aea04386f6.js"],"default"] 11:I[25152,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/cb0f98aea04386f6.js"],"default"] 12:T4f8,class Solution { public List survivedRobotsHealths(int[] positions, int[] healths, String directions) { int n = positions.length; Integer[] indices = new Integer[n]; for (int i = 0; i < n; i++) indices[i] = i; Arrays.sort(indices, (a, b) -> Integer.compare(positions[a], positions[b])); Stack stack = new Stack<>(); for (int curr : indices) { if (directions.charAt(curr) == 'R') { stack.push(curr); } else { while (!stack.isEmpty() && healths[curr] > 0) { int top = stack.pop(); if (healths[top] > healths[curr]) { healths[top] -= 1; healths[curr] = 0; stack.push(top); } else if (healths[top] < healths[curr]) { healths[curr] -= 1; healths[top] = 0; } else { healths[curr] = 0; healths[top] = 0; } } } } List result = new ArrayList<>(); for (int h : healths) if (h > 0) result.add(h); return result; } }13:T501,class Solution { public: vector survivedRobotsHealths(vector& positions, vector& healths, string directions) { int n = positions.size(); vector indices(n); iota(indices.begin(), indices.end(), 0); sort(indices.begin(), indices.end(), [&](int a, int b) { return positions[a] < positions[b]; }); stack st; for (int curr : indices) { if (directions[curr] == 'R') { st.push(curr); } else { while (!st.empty() && healths[curr] > 0) { int top = st.top(); st.pop(); if (healths[top] > healths[curr]) { healths[top] -= 1; healths[curr] = 0; st.push(top); } else if (healths[top] < healths[curr]) { healths[curr] -= 1; healths[top] = 0; } else { healths[curr] = 0; healths[top] = 0; } } } } vector result; for (int h : healths) if (h > 0) result.push_back(h); return result; } };

Time Complexity

Space Complexity