SOLUTION INFO
C++ · main.cpp
class Solution {
public:
vector<int> minOperations(string boxes) {
int N = (int)boxes.size();
vector<int> V(N + 2);
int left_cnt = 0, sum = 0;
vector<int> answer(N);
for(int i = 1; i <= N; ++i) {
answer[i - 1] = sum;
if(boxes[i - 1] == '1') ++ left_cnt;
sum += left_cnt;
}
int right_cnt = 0; sum = 0;
for(int i = N; i >= 1; --i) {
answer[i - 1] += sum;
if(boxes[i - 1] == '1') ++ right_cnt;
sum += right_cnt;
}
return answer;
}
};
SOLUTION DESCRIPTION
풀이 설명
등록된 풀이 설명이 없습니다.