From 3295c6cc70db780dcbfdc0a63d326b4362cb15ce Mon Sep 17 00:00:00 2001 From: ductnn Date: Fri, 17 May 2024 16:22:23 +0700 Subject: [PATCH] add sol --- leetcode/1480.RunningSumof1dArray/sol.go | 21 +++++++++++++++++++++ leetcode/1480.RunningSumof1dArray/sol.py | 6 ++++++ 2 files changed, 27 insertions(+) create mode 100644 leetcode/1480.RunningSumof1dArray/sol.go create mode 100644 leetcode/1480.RunningSumof1dArray/sol.py diff --git a/leetcode/1480.RunningSumof1dArray/sol.go b/leetcode/1480.RunningSumof1dArray/sol.go new file mode 100644 index 0000000..10a9d5d --- /dev/null +++ b/leetcode/1480.RunningSumof1dArray/sol.go @@ -0,0 +1,21 @@ +// https://leetcode.com/problems/running-sum-of-1d-array/description/ + +package main + +import ( + "fmt" +) + +func runningSum(nums []int) []int { + for i := 1; i < len(nums); i++ { + nums[i] += nums[i-1] + } + + return nums +} + +func main() { + nums := []int{1, 1, 1, 1, 1} + + fmt.Println(runningSum(nums)) +} diff --git a/leetcode/1480.RunningSumof1dArray/sol.py b/leetcode/1480.RunningSumof1dArray/sol.py new file mode 100644 index 0000000..2085595 --- /dev/null +++ b/leetcode/1480.RunningSumof1dArray/sol.py @@ -0,0 +1,6 @@ +class Solution: + def runningSum(self, nums: List[int]) -> List[int]: + for i in range(1, len(nums)): + nums[i] += nums[i-1] + + return nums