diff --git a/solution/0500-0599/0517.Super Washing Machines/README.md b/solution/0500-0599/0517.Super Washing Machines/README.md index 002160d5fcd26..7cd67db537ea6 100644 --- a/solution/0500-0599/0517.Super Washing Machines/README.md +++ b/solution/0500-0599/0517.Super Washing Machines/README.md @@ -58,6 +58,25 @@ +**方法一：贪心** + +如果洗衣机内的衣服总数不能被洗衣机的数量整除，那么不可能使得每台洗衣机内的衣服数量相等，直接返回 $-1$。 + +否则，假设洗衣机内的衣服总数为 $s$，那么最终每台洗衣机内的衣服数量都会变为 $k = s / n$。 + +我们定义 $a_i$ 为第 $i$ 台洗衣机内的衣服数量与 $k$ 的差值，即 $a_i = \text{machines}[i] - k$。若 $a_i > 0$，则表示第 $i$ 台洗衣机内有多余的衣服，需要向相邻的洗衣机传递；若 $a_i < 0$，则表示第 $i$ 台洗衣机内缺少衣服，需要从相邻的洗衣机获得。 + +我们将前 $i$ 台洗衣机的衣服数量差值之和定义为 $s_i = \sum_{j=0}^{i-1} a_j$，如果把前 $i$ 台洗衣机视为一组，其余的洗衣机视为另一组。那么若 $s_i$ 为正数，表示第一组洗衣机内有多余的衣服，需要向第二组洗衣机传递；若 $s_i$ 为负数，表示第一组洗衣机内缺少衣服，需要从第二组洗衣机获得。 + +那么有以下两种情况： + +1. 两组之间的衣服，最多需要移动的次数为 $\max_{i=0}^{n-1} \lvert s_i \rvert$； +1. 组内某一台洗衣机的衣服数量过多，需要向左右两侧移出衣服，最多需要移动的次数为 $\max_{i=0}^{n-1} a_i$。 + +我们取两者的最大值即可。 + +时间复杂度 $O(n)$，其中 $n$ 为洗衣机的数量。空间复杂度 $O(1)$。 + ### **Python3** @@ -65,7 +84,18 @@ ```python - +class Solution: + def findMinMoves(self, machines: List[int]) -> int: + n = len(machines) + k, mod = divmod(sum(machines), n) + if mod: + return -1 + ans = s = 0 + for x in machines: + x -= k + s += x + ans = max(ans, abs(s), x) + return ans ``` ### **Java** @@ -73,7 +103,109 @@ ```java +class Solution { + public int findMinMoves(int[] machines) { + int n = machines.length; + int s = 0; + for (int x : machines) { + s += x; + } + if (s % n != 0) { + return -1; + } + int k = s / n; + s = 0; + int ans = 0; + for (int x : machines) { + x -= k; + s += x; + ans = Math.max(ans, Math.max(Math.abs(s), x)); + } + return ans; + } +} +``` + +### **C++** + +```cpp +class Solution { +public: + int findMinMoves(vector& machines) { + int n = machines.size(); + int s = accumulate(machines.begin(), machines.end(), 0); + if (s % n) { + return -1; + } + int k = s / n; + s = 0; + int ans = 0; + for (int x : machines) { + x -= k; + s += x; + ans = max({ans, abs(s), x}); + } + return ans; + } +}; +``` + +### **Go** + +```go +func findMinMoves(machines []int) (ans int) { + n := len(machines) + s := 0 + for _, x := range machines { + s += x + } + if s%n != 0 { + return -1 + } + k := s / n + s = 0 + for _, x := range machines { + x -= k + s += x + ans = max(ans, max(abs(s), x)) + } + return +} + +func max(a, b int) int { + if a > b { + return a + } + return b +} + +func abs(x int) int { + if x < 0 { + return -x + } + return x +} +``` +### **TypeScript** + +```ts +function findMinMoves(machines: number[]): number { + const n = machines.length; + let s = machines.reduce((a, b) => a + b); + if (s % n !== 0) { + return -1; + } + const k = Math.floor(s / n); + s = 0; + let ans = 0; + for (let x of machines) { + x -= k; + s += x; + ans = Math.max(ans, Math.abs(s), x); + } + return ans; +} ``` ### **...** diff --git a/solution/0500-0599/0517.Super Washing Machines/README_EN.md b/solution/0500-0599/0517.Super Washing Machines/README_EN.md index 0c6b78dc2b4b7..5927ab53a9c01 100644 --- a/solution/0500-0599/0517.Super Washing Machines/README_EN.md +++ b/solution/0500-0599/0517.Super Washing Machines/README_EN.md @@ -57,13 +57,126 @@ It's impossible to make all three washing machines have the same number of d ### **Python3** ```python - +class Solution: + def findMinMoves(self, machines: List[int]) -> int: + n = len(machines) + k, mod = divmod(sum(machines), n) + if mod: + return -1 + ans = s = 0 + for x in machines: + x -= k + s += x + ans = max(ans, abs(s), x) + return ans ``` ### **Java** ```java +class Solution { + public int findMinMoves(int[] machines) { + int n = machines.length; + int s = 0; + for (int x : machines) { + s += x; + } + if (s % n != 0) { + return -1; + } + int k = s / n; + s = 0; + int ans = 0; + for (int x : machines) { + x -= k; + s += x; + ans = Math.max(ans, Math.max(Math.abs(s), x)); + } + return ans; + } +} +``` + +### **C++** + +```cpp +class Solution { +public: + int findMinMoves(vector& machines) { + int n = machines.size(); + int s = accumulate(machines.begin(), machines.end(), 0); + if (s % n) { + return -1; + } + int k = s / n; + s = 0; + int ans = 0; + for (int x : machines) { + x -= k; + s += x; + ans = max({ans, abs(s), x}); + } + return ans; + } +}; +``` + +### **Go** + +```go +func findMinMoves(machines []int) (ans int) { + n := len(machines) + s := 0 + for _, x := range machines { + s += x + } + if s%n != 0 { + return -1 + } + k := s / n + s = 0 + for _, x := range machines { + x -= k + s += x + ans = max(ans, max(abs(s), x)) + } + return +} + +func max(a, b int) int { + if a > b { + return a + } + return b +} + +func abs(x int) int { + if x < 0 { + return -x + } + return x +} +``` +### **TypeScript** + +```ts +function findMinMoves(machines: number[]): number { + const n = machines.length; + let s = machines.reduce((a, b) => a + b); + if (s % n !== 0) { + return -1; + } + const k = Math.floor(s / n); + s = 0; + let ans = 0; + for (let x of machines) { + x -= k; + s += x; + ans = Math.max(ans, Math.abs(s), x); + } + return ans; +} ``` ### **...** diff --git a/solution/0500-0599/0517.Super Washing Machines/Solution.cpp b/solution/0500-0599/0517.Super Washing Machines/Solution.cpp new file mode 100644 index 0000000000000..1ce32cb2f4b75 --- /dev/null +++ b/solution/0500-0599/0517.Super Washing Machines/Solution.cpp @@ -0,0 +1,19 @@ +class Solution { +public: + int findMinMoves(vector& machines) { + int n = machines.size(); + int s = accumulate(machines.begin(), machines.end(), 0); + if (s % n) { + return -1; + } + int k = s / n; + s = 0; + int ans = 0; + for (int x : machines) { + x -= k; + s += x; + ans = max({ans, abs(s), x}); + } + return ans; + } +}; \ No newline at end of file diff --git a/solution/0500-0599/0517.Super Washing Machines/Solution.go b/solution/0500-0599/0517.Super Washing Machines/Solution.go new file mode 100644 index 0000000000000..b7e2aaef198bd --- /dev/null +++ b/solution/0500-0599/0517.Super Washing Machines/Solution.go @@ -0,0 +1,32 @@ +func findMinMoves(machines []int) (ans int) { + n := len(machines) + s := 0 + for _, x := range machines { + s += x + } + if s%n != 0 { + return -1 + } + k := s / n + s = 0 + for _, x := range machines { + x -= k + s += x + ans = max(ans, max(abs(s), x)) + } + return +} + +func max(a, b int) int { + if a > b { + return a + } + return b +} + +func abs(x int) int { + if x < 0 { + return -x + } + return x +} \ No newline at end of file diff --git a/solution/0500-0599/0517.Super Washing Machines/Solution.java b/solution/0500-0599/0517.Super Washing Machines/Solution.java new file mode 100644 index 0000000000000..d7fb2608c02d3 --- /dev/null +++ b/solution/0500-0599/0517.Super Washing Machines/Solution.java @@ -0,0 +1,21 @@ +class Solution { + public int findMinMoves(int[] machines) { + int n = machines.length; + int s = 0; + for (int x : machines) { + s += x; + } + if (s % n != 0) { + return -1; + } + int k = s / n; + s = 0; + int ans = 0; + for (int x : machines) { + x -= k; + s += x; + ans = Math.max(ans, Math.max(Math.abs(s), x)); + } + return ans; + } +} \ No newline at end of file diff --git a/solution/0500-0599/0517.Super Washing Machines/Solution.py b/solution/0500-0599/0517.Super Washing Machines/Solution.py new file mode 100644 index 0000000000000..f4cfb0c4b4c51 --- /dev/null +++ b/solution/0500-0599/0517.Super Washing Machines/Solution.py @@ -0,0 +1,12 @@ +class Solution: + def findMinMoves(self, machines: List[int]) -> int: + n = len(machines) + k, mod = divmod(sum(machines), n) + if mod: + return -1 + ans = s = 0 + for x in machines: + x -= k + s += x + ans = max(ans, abs(s), x) + return ans diff --git a/solution/0500-0599/0517.Super Washing Machines/Solution.ts b/solution/0500-0599/0517.Super Washing Machines/Solution.ts new file mode 100644 index 0000000000000..1da9382881308 --- /dev/null +++ b/solution/0500-0599/0517.Super Washing Machines/Solution.ts @@ -0,0 +1,16 @@ +function findMinMoves(machines: number[]): number { + const n = machines.length; + let s = machines.reduce((a, b) => a + b); + if (s % n !== 0) { + return -1; + } + const k = Math.floor(s / n); + s = 0; + let ans = 0; + for (let x of machines) { + x -= k; + s += x; + ans = Math.max(ans, Math.abs(s), x); + } + return ans; +}