목록라인 스위핑 (1)

넘치게 채우기

[LeetCode] 1769. Minimum Number of Operations to Move All Balls to Each Box

https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/description/leetcode - Minimum Number of Operations to Move All Balls to Each Box문제 유형: 그리디, 구간합, 라인 스위핑문제 난이도: Medium 문제You have n boxes. You are given a binary string boxes of length n, where boxes[i] is '0' if the ith box is empty, and '1' if it contains one ball.In one operation, you can move one ball fr..
PS/LeetCode 2025. 1. 6. 10:52
이전 Prev 1 Next 다음