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.
2 parents 1ef962f + 54d10fc commit d00168dCopy full SHA for d00168d
problems/0300.最长上升子序列.md
@@ -237,6 +237,27 @@ const lengthOfLIS = (nums) => {
237
};
238
```
239
240
+TypeScript
241
+
242
+```typescript
243
+function lengthOfLIS(nums: number[]): number {
244
+ /**
245
+ dp[i]: 前i个元素中,以nums[i]结尾,最长子序列的长度
246
+ */
247
+ const dp: number[] = new Array(nums.length).fill(1);
248
+ let resMax: number = 0;
249
+ for (let i = 0, length = nums.length; i < length; i++) {
250
+ for (let j = 0; j < i; j++) {
251
+ if (nums[i] > nums[j]) {
252
+ dp[i] = Math.max(dp[i], dp[j] + 1);
253
+ }
254
255
+ resMax = Math.max(resMax, dp[i]);
256
257
+ return resMax;
258
+};
259
+```
260
261
262
263
0 commit comments