Confusing on a test case
An official test case is\n\n[2,5,5,-7,4]\n7\n464680098\n\n\nFirstly I\'m confusing why the goal could be much greater than len(nums) * limit, as from the descri
An official test case is\n```\n[2,5,5,-7,4]\n7\n464680098\n```\n\nFirstly I\'m confusing why the goal could be much greater than `len(nums) * limit`, as from the description `nums` shouldn\'t be extended. Put this question aside, as `goal` is obviously greater than `len(nums) * limit`, we should modify all the elements in current `nums`, which modified **5** elements, and the current sum is 35, there is still a gap of 464680098 - 35 = 464680063. \n\nIf we can push new elements to `nums`, under the constraint that the abs of new elements shouldn\'t exceed `limit`, we should push in as many 7s as possible. Since 464680063 // 7 = 66382866, and 464680063 - 66382866 * 7 = 1, we should put in 66382866 7s and one more 1. The number of total elements to be modified is 66382866 + 1 + 5 = 66382872. But the answer is 66382870, so why?
[]