Python force button brushing record-1480. Dynamic sum of one-dimensional array

topic:

Give you an array of nums. The calculation formula of the "dynamic sum" of the array is: runningSum[i] = sum(nums[0]…nums[i]). Please return
the dynamic sum of nums.

Method 1:
Execution time: 44 ms
Memory consumption: 13.5 MB

class Solution:
    def runningSum(self, nums: List[int]) -> List[int]:
        for i in range(1, len(nums)):
            nums[i] += nums[i-1]
        return nums

Method 2:
Execution time: 36 ms
Memory consumption: 13.5 MB

class Solution:
    def runningSum(self, nums: List[int]) -> List[int]:
        nums_sum = []
        temp = 0
        for i in nums:
            nums_sum.append(i+temp) 
            temp += i
        return nums_sum

Method 3:
Execution time: 56 ms
Memory consumption: 13.6 MB

class Solution:
    def runningSum(self, nums: List[int]) -> List[int]:
        sum_nums = []
        for i in range(len(nums)):
            sum_nums.append(sum(nums[:i+1]))
        return sum_nums

Method 4:
Execution time: 36 ms
Memory consumption: 13.6 MB

class Solution:
    def runningSum(self, nums: List[int]) -> List[int]:
        sum_nums = [0]
        for i in range(len(nums)):
            num = sum_nums[i] + nums[i]
            sum_nums.append(num)
        return sum_nums[1:]