leetcode - 1769. Minimum Number of Operations to Move All Balls to Each Box

Description

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 from a box to an adjacent box. Box i is adjacent to box j if abs(i - j) == 1. Note that after doing so, there may be more than one ball in some boxes.

Return an array answer of size n, where answer[i] is the minimum number of operations needed to move all the balls to the ith box.

Each answer[i] is calculated considering the initial state of the boxes.

Example 1:

复制代码
Input: boxes = "110"
Output: [1,1,3]
Explanation: The answer for each box is as follows:
1) First box: you will have to move one ball from the second box to the first box in one operation.
2) Second box: you will have to move one ball from the first box to the second box in one operation.
3) Third box: you will have to move one ball from the first box to the third box in two operations, and move one ball from the second box to the third box in one operation.

Example 2:

复制代码
Input: boxes = "001011"
Output: [11,8,5,4,3,4]

Constraints:

复制代码
n == boxes.length
1 <= n <= 2000
boxes[i] is either '0' or '1'.

Solution

Brute Force

Iterate once to get all the indexes of balls, then iterate again to calculate: ∑ ∣ ball_index − i ∣ \sum |\text{ball\_index} - i| ∑∣ball_index−i∣

Time complexity: o ( n 2 ) o(n^2) o(n2)

Space complexity: o ( n ) o(n) o(n)

Prefix sum

Like 238. Product of Array Except Self, we can have left_cnt to denote the number of balls at the left of the current index, when moving one step forward, we have an extra left_cnt cost to move all the balls. We could do the same for right_cnt, and the final result would be left_cost + right_cost.

Time complexity: o ( n ) o(n) o(n)

Space complexity: o ( 1 ) o(1) o(1)

Code

Brute Force

python3 复制代码
class Solution:
    def minOperations(self, boxes: str) -> List[int]:
        ball_indexes = []
        for i in range(len(boxes)):
            if boxes[i] == '1':
                ball_indexes.append(i)
        res = []
        for i in range(len(boxes)):
            cur_res = 0
            for each_ball_index in ball_indexes:
                cur_res += abs(each_ball_index - i)
            res.append(cur_res)
        return res

Prefix sum

python3 复制代码
class Solution:
    def minOperations(self, boxes: str) -> List[int]:
        res = [0] * len(boxes)
        left_cnt = 0
        left_cost = 0
        for i in range(1, len(boxes)):
            if boxes[i - 1] == '1':
                left_cnt += 1
            left_cost += left_cnt
            res[i] += left_cost
        right_cnt = 0
        right_cost = 0
        for i in range(len(boxes) - 2, -1, -1):
            if boxes[i + 1] == '1':
                right_cnt += 1
            right_cost += right_cnt
            res[i] += right_cost
        return res
相关推荐
前端炒粉3 小时前
18.矩阵置零(原地算法)
javascript·线性代数·算法·矩阵
Wnq100723 小时前
AI 在法律咨询服务中的革命性变化:技术赋能与生态重构
人工智能·职场和发展·重构·分类·数据分析·全文检索·创业创新
暴风鱼划水4 小时前
三维重建【0-D】3D Gaussian Splatting:相机标定原理与步骤
算法·3d
mount_myj6 小时前
敏感信息屏蔽(一)【java】
java·算法·极课堂
先做个垃圾出来………7 小时前
偏移量解释
数据结构·算法
Dream it possible!7 小时前
LeetCode 面试经典 150_链表_旋转链表(64_61_C++_中等)
c++·leetcode·链表·面试
FanXing_zl7 小时前
基于整数MCU的FOC控制定标策略深度解析
单片机·嵌入式硬件·mcu·算法·定点运算·q15
立志成为大牛的小牛7 小时前
数据结构——三十三、Dijkstra算法(王道408)
数据结构·笔记·学习·考研·算法·图论
地平线开发者8 小时前
mul 与 reduce_sum 的优化实例
算法·自动驾驶