commit

Change-Id: I27c3e15333fd8ff3d48b1da2e86af88e20ea2b99

Author: Wang-Jun-Chao

.gitignore

@@ -26,4 +26,5 @@ out
 
 # virtual machine crash logs, see http://www.java.com/en/download/help/error_hotspot.xml
 hs_err_pid*
+*/*.iml
 

.idea/leetcode/editor.xml

@@ -0,0 +1,21 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+    <orderEntry type="module-library">
+      <library name="JUnit4">
+        <CLASSES>
+          <root url="jar://$MODULE_DIR$/../lib/junit-4.12.jar!/" />
+          <root url="jar://$MODULE_DIR$/../lib/hamcrest-core-1.3.jar!/" />
+        </CLASSES>
+        <JAVADOC />
+        <SOURCES />
+      </library>
+    </orderEntry>
+  </component>
+</module>

.idea/modules.xml

@@ -0,0 +1,36 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-06-28 21:38
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    /**
+     * 解题思路：
+     * 假设数组最小的值是xmin，一共加了k次，加完后的值是W，元素个数是n
+     * 则：W <= xmin + k
+     * k(n-1) + sum(nums) = W*n
+     * ==>
+     * k(n-1) + sum(nums) <= (xmin + k)n
+     * ==>
+     * sum(nums) - n*xmin <= k
+     *
+     * @param nums
+     * @return
+     */
+    public int minMoves(int[] nums) {
+
+        int sum = 0;
+        int min = Integer.MAX_VALUE;
+
+        for (int i : nums) {
+            sum += i;
+            if (i < min) {
+                min = i;
+            }
+        }
+
+        return sum - min * nums.length;
+    }
+}

.idea/workspace.xml

@@ -0,0 +1,27 @@
+import org.junit.Assert;
+import org.junit.Test;
+
+import java.lang.annotation.Target;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-28 22:09
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+    @Test
+    public void test1() {
+        Solution s = new Solution();
+        Object[][] data = {
+                {new int[]{1, 2, 3}, 3},
+                {new int[]{1, 1, 1}, 0},
+                {new int[]{1, 1, 2}, 1},
+        };
+
+        for (Object[] d : data) {
+            Assert.assertEquals(s.minMoves((int[]) d[0]), d[1]);
+        }
+    }
+}