一刷1480

Author: diguage

README.adoc

@@ -10386,12 +10386,12 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 //|Hard
 //|
 
-//|{counter:codes}
-//|{leetcode_base_url}/running-sum-of-1d-array/[1480. Running Sum of 1d Array^]
-//|{source_base_url}/_1480_RunningSumOf1DArray.java[Java]
-//|{doc_base_url}/1480-running-sum-of-1d-array.adoc[题解]
-//|Easy
-//|
+|{counter:codes}
+|{leetcode_base_url}/running-sum-of-1d-array/[1480. Running Sum of 1d Array^]
+|{source_base_url}/_1480_RunningSumOf1DArray.java[Java]
+|{doc_base_url}/1480-running-sum-of-1d-array.adoc[题解]
+|Easy
+|
 
 //|{counter:codes}
 //|{leetcode_base_url}/least-number-of-unique-integers-after-k-removals/[1481. Least Number of Unique Integers after K Removals^]

docs/1480-running-sum-of-1d-array.adoc

@@ -8,7 +8,7 @@ Given an array `nums`. We define a running sum of an array as `runningSum[i] = s
 Return the running sum of `nums`.
 
 
-<strong class="example">Example 1:*
+*Example 1:*
 
 [subs="verbatim,quotes"]
 ----
@@ -17,7 +17,7 @@ Return the running sum of `nums`.
 *Explanation:* Running sum is obtained as follows: [1, 1+2, 1+2+3, 1+2+3+4].
 ----
 
-<strong class="example">Example 2:*
+*Example 2:*
 
 [subs="verbatim,quotes"]
 ----
@@ -26,7 +26,7 @@ Return the running sum of `nums`.
 *Explanation:* Running sum is obtained as follows: [1, 1+1, 1+1+1, 1+1+1+1, 1+1+1+1+1].
 ----
 
-<strong class="example">Example 3:*
+*Example 3:*
 
 [subs="verbatim,quotes"]
 ----
@@ -39,14 +39,14 @@ Return the running sum of `nums`.
 *Constraints:*
 
 
-* `1 <= nums.length <= 1000`
-* `-10^6 <= nums[i] <= 10^6`
-
+* `1 \<= nums.length \<= 1000`
+* `-10^6 \<= nums[i] \<= 10^6`
 
 
 
 == 思路分析
 
+image::images/1480-01.gif[{image_attr}]
 
 [[src-1480]]
 [tabs]
@@ -73,4 +73,6 @@ include::{sourcedir}/_1480_RunningSumOf1DArray.java[tag=answer]
 
 == 参考资料
 
+. https://leetcode.cn/problems/running-sum-of-1d-array/solutions/1645947/by-jyd-hz70/?envType=study-plan-v2&envId=selected-coding-interview[1480. 一维数组的动态和 -动态规划，清晰图解^]
+
 

docs/images/1480-01.gif

@@ -3034,7 +3034,7 @@ include::1109-corporate-flight-bookings.adoc[leveloffset=+1]
 
 // include::1479-sales-by-day-of-the-week.adoc[leveloffset=+1]
 
-// include::1480-running-sum-of-1d-array.adoc[leveloffset=+1]
+include::1480-running-sum-of-1d-array.adoc[leveloffset=+1]
 
 // include::1481-least-number-of-unique-integers-after-k-removals.adoc[leveloffset=+1]
 

docs/index.adoc

@@ -515,6 +515,11 @@
 |{doc_base_url}/0226-invert-binary-tree.adoc[题解]
 |分治
 
+|{counter:codes}
+|{leetcode_base_url}/running-sum-of-1d-array/[1480. Running Sum of 1d Array^]
+|{doc_base_url}/1480-running-sum-of-1d-array.adoc[题解]
+|动态规划入门
+
 |===
 
 截止目前，本轮练习一共完成 {codes} 道题。

logbook/202406.adoc

@@ -0,0 +1,19 @@
+package com.diguage.algo.leetcode;
+
+public class _1480_RunningSumOf1DArray {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-09-13 23:14:43
+   */
+  public int[] runningSum(int[] nums) {
+    int[] dp = new int[nums.length];
+    dp[0] = nums[0];
+    for (int i = 1; i < nums.length; i++) {
+      dp[i] = nums[i] + dp[i - 1];
+    }
+    return dp;
+  }
+  // end::answer[]
+}