add 1785

fishercoder1534 · fishercoder1534 · commit 37c743ba519d · 2021-03-06T20:21:58.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1785|[Minimum Elements to Add to Form a Given Sum](https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1785.java) ||Medium|Greedy|
 |1784|[Check if Binary String Has at Most One Segment of Ones](https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1784.java) ||Easy|Greedy|
 |1781|[Sum of Beauty of All Substrings](https://leetcode.com/problems/sum-of-beauty-of-all-substrings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1781.java) ||Medium|HashTable, String|
 |1780|[Check if Number is a Sum of Powers of Three](https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1780.java) ||Medium|Math, Backtracking, Recursion|
diff --git a/src/main/java/com/fishercoder/solutions/_1785.java b/src/main/java/com/fishercoder/solutions/_1785.java
@@ -0,0 +1,14 @@
+package com.fishercoder.solutions;
+
+public class _1785 {
+    public static class Solution1 {
+        public int minElements(int[] nums, int limit, int goal) {
+            long sum = 0;
+            for (int num : nums) {
+                sum += num;
+            }
+            long diff = Math.abs(goal - sum);
+            return diff % limit == 0 ? (int) (diff / limit) : (int) ((diff / limit) + 1);
+        }
+    }
+}
