LeetCode_1480_一维数组的动态和

题目链接

• https://leetcode-cn.com/problems/running-sum-of-1d-array/

解题思路

• 原地累加即可

AC代码

class Solution {
    public static int[] runningSum(int[] nums) {
        for (int i = 1; i < nums.length; i++) {
            nums[i] += nums[i - 1];
        }
        return nums;
    }
}

本地测试代码

package com.company;

import java.util.Arrays;
import java.util.Scanner;

public class Solution_1480 {
    public static int[] runningSum(int[] nums) {
        for (int i = 1; i < nums.length; i++) {
            nums[i] += nums[i - 1];
        }
        return nums;
    }

    public static void main(String[] args) {
        Scanner a = new Scanner(System.in);
        int num = a.nextInt();//数组元素的个数
        int[] b = new int[num];
        for (int i = 0; i < num; i++) {
            b[i] = a.nextInt();
        }
        int[] out = runningSum(b);
        System.out.println(Arrays.toString(out));//数组的输出
    }
}