We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 3067999 commit a6bf72dCopy full SHA for a6bf72d
53.最大子序和.js
@@ -0,0 +1,28 @@
1
+/*
2
+ * @lc app=leetcode.cn id=53 lang=javascript
3
+ *
4
+ * [53] 最大子序和
5
+ */
6
+
7
+// @lc code=start
8
+/**
9
+ * @param {number[]} nums
10
+ * @return {number}
11
12
+var maxSubArray = function(nums) {
13
+ let result = nums[0] || 0;
14
+ let dp = [];
15
16
+ for (let i = 0; i < nums.length; i++) {
17
+ if (i === 0) {
18
+ dp[i] = nums[i];
19
+ } else {
20
+ dp[i] = Math.max(nums[i], dp[i - 1] + nums[i]);
21
+ }
22
+ result = Math.max(result, dp[i]);
23
24
25
+ return result;
26
+};
27
+// @lc code=end
28
0 commit comments