We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent aafc18e commit 4d2b80cCopy full SHA for 4d2b80c
problems/0053.最大子序和(动态规划).md
@@ -186,6 +186,24 @@ const maxSubArray = nums => {
186
};
187
```
188
189
+TypeScript:
190
+
191
+```typescript
192
+function maxSubArray(nums: number[]): number {
193
+ /**
194
+ dp[i]:以nums[i]结尾的最大和
195
+ */
196
+ const dp: number[] = []
197
+ dp[0] = nums[0];
198
+ let resMax: number = 0;
199
+ for (let i = 1; i < nums.length; i++) {
200
+ dp[i] = Math.max(dp[i - 1] + nums[i], nums[i]);
201
+ resMax = Math.max(resMax, dp[i]);
202
+ }
203
+ return resMax;
204
+};
205
+```
206
207
208
209
-----------------------
0 commit comments