Merge pull request #845 from 0xff-dev/1769

Add solution and test-cases for problem 1769

Author: 6boris

leetcode/1701-1800/1769.Minimum-Number-of-Operations-to-Move-All-Balls-to-Each-Box/README.md

@@ -1,28 +1,31 @@
 # [1769.Minimum Number of Operations to Move All Balls to Each Box][title]
 
-> [!WARNING|style:flat]
-> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
-
 ## Description
+You have `n` boxes. You are given a binary string `boxes` of length `n`, where `boxes[i]` is '0' if the i<sup>th</sup> 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 i<sup>th</sup> box.
+
+Each `answer[i]` is calculated considering the **initial** state of the boxes.
 
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+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:**
 
-## 题解
-
-### 思路1
-> ...
-Minimum Number of Operations to Move All Balls to Each Box
-```go
 ```
-
+Input: boxes = "001011"
+Output: [11,8,5,4,3,4]
+```
 
 ## 结语
 

leetcode/1701-1800/1769.Minimum-Number-of-Operations-to-Move-All-Balls-to-Each-Box/Solution.go

@@ -1,5 +1,21 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(boxes string) []int {
+	ans := make([]int, len(boxes))
+	pos := make([]int, 0)
+	for i := 0; i < len(boxes); i++ {
+		if boxes[i] == '1' {
+			pos = append(pos, i)
+		}
+	}
+	for i := 0; i < len(boxes); i++ {
+		for _, p := range pos {
+			diff := p - i
+			if diff < 0 {
+				diff = -diff
+			}
+			ans[i] += diff
+		}
+	}
+	return ans
 }

leetcode/1701-1800/1769.Minimum-Number-of-Operations-to-Move-All-Balls-to-Each-Box/Solution_test.go

@@ -10,12 +10,11 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		inputs string
+		expect []int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", "110", []int{1, 1, 3}},
+		{"TestCase2", "001011", []int{11, 8, 5, 4, 3, 4}},
 	}
 
 	//	开始测试
@@ -30,10 +29,10 @@ func TestSolution(t *testing.T) {
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }