STUDY/Algorithm
![[TIL] leetcode: Running Sum of 1d Array](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2Fc8cUg8%2FbtsrBqyY8Ga%2FAAAAAAAAAAAAAAAAAAAAAH1s0OOtzbt5nTL6nIYF5RUkZne22IhfPSnVDK61kZV7%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DgxPL4EVutxx2iT%252FfpvmDenqPeRY%253D)
[TIL] leetcode: Running Sum of 1d Array
Running Sum of 1d Array - LeetCode Can you solve this real interview question? Running Sum of 1d Array - Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nums. Example 1: Input: nums = [1,2,3,4] Output: [1,3,6, leetcode.com 문제 배열이 주어지고, 첫번째 인덱스부터 i번째 인덱스까지의 값을 더한 값을 i번째 index에 넣은 배열을 출력하는 문제 내 코드 앞의 합을 따로 저장해주면 되겠네 싶어서 짠 ..