C++ py3 C Rust速解Leetcode 1526 Minimum Number of Increments on Subarrays ...

C++ py3 C Rust adjacent difference與loop速解Leetcode 1526 Minimum Number of Increments on Subarrays to Form a Target Array

[Py3一行解請進]

[codes on Leetcode]https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/solutions/7312093/adjacent_differenceaccumulate-vs-1-passb-hpsr/

class Solution:
    def minNumberOperations(self, t: List[int]) -> int:
        return t[0]+sum(max(x-y, 0) for x, y in zip(t[1:], t))