{"id":8212,"date":"2021-03-06T22:32:26","date_gmt":"2021-03-07T06:32:26","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=8212"},"modified":"2021-03-06T22:34:06","modified_gmt":"2021-03-07T06:34:06","slug":"leetcode-1785-minimum-elements-to-add-to-form-a-given-sum","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/math\/leetcode-1785-minimum-elements-to-add-to-form-a-given-sum\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 1785. Minimum Elements to Add to Form a Given Sum"},"content":{"rendered":"\n

You are given an integer array nums<\/code> and two integers limit<\/code> and goal<\/code>. The array nums<\/code> has an interesting property that abs(nums[i]) <= limit<\/code>.<\/p>\n\n\n\n

Return the minimum number of elements you need to add to make the sum of the array equal to <\/em>goal<\/code>. The array must maintain its property that abs(nums[i]) <= limit<\/code>.<\/p>\n\n\n\n

Note that abs(x)<\/code> equals x<\/code> if x >= 0<\/code>, and -x<\/code> otherwise.<\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> nums = [1,-1,1], limit = 3, goal = -4\nOutput:<\/strong> 2\nExplanation:<\/strong> You can add -2 and -3, then the sum of the array will be 1 - 1 + 1 - 2 - 3 = -4.\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> nums = [1,-10,9,1], limit = 100, goal = 0\nOutput:<\/strong> 1\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 1 <= nums.length <= 105<\/sup><\/code><\/li>
  • 1 <= limit <= 106<\/sup><\/code><\/li>
  • -limit <= nums[i] <= limit<\/code><\/li>
  • -109<\/sup> <= goal <= 109<\/sup><\/code><\/li><\/ul>\n\n\n\n
    Solution: Math<\/strong><\/h2>\n\n\n\n
    Time complexity: O(n)
    Space complexity: O(1)<\/p>\n\n\n\n
    Compute the diff = abs(sum(nums) – goal)
    ans = \uff08diff + limit – 1)) \/ limit<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \n\/\/ Author: Huahua\nclass Solution {\npublic:\n  int minElements(vector& nums, int limit, int goal) {\n    int64_t diff = abs(goal - \n                       accumulate(begin(nums), end(nums), 0LL));\n    return (diff + limit - 1) \/ limit;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    You are given an integer array nums and two integers limit and goal. The array nums has an interesting property that abs(nums[i]) <= limit. Return the minimum number of elements you need to add…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[49],"tags":[31,177],"class_list":["post-8212","post","type-post","status-publish","format-standard","hentry","category-math","tag-math","tag-medium","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8212","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=8212"}],"version-history":[{"count":4,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8212\/revisions"}],"predecessor-version":[{"id":8217,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8212\/revisions\/8217"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=8212"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=8212"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=8212"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}