Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commitb2a1db9

Browse files
committed
update: 300
1 parentd09ae95 commitb2a1db9

File tree

3 files changed

+28
-2
lines changed

3 files changed

+28
-2
lines changed

‎README.md

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -101,10 +101,11 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
101101
|289|[Game of Life](https://leetcode.com/problems/game-of-life/)|[JavaScript](./src/game-of-life/res.js)|Medium|
102102
|295|[Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/)|[JavaScript](./src/find-median-from-data-stream/res.js)|Hard|
103103
|299|[Bulls and Cows](https://leetcode.com/problems/bulls-and-cows/)|[JavaScript](./src/bulls-and-cows/res.js)|Medium|
104+
|300|[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)|[JavaScript](./src/longest-increasing-subsequence/res.js)|Medium|
104105
|307|[Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/)|[JavaScript](./src/range-sum-query-mutable/res.js)|Medium|
105106
|309|[Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/)|[JavaScript](./src/best-time-to-buy-and-sell-stock-with-cooldown/res.js)|Medium|
106107
|310|[Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/)|[JavaScript](./src/minimum-height-trees/res.js)|Medium|
107-
|315|[Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/)|[JavaScript](./src/count-of-smaller-numbers-after-self/res.js)|Hard|
108+
|315|[Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/)<sup>*</sup>|[JavaScript](./src/count-of-smaller-numbers-after-self/res.js)|Hard|
108109
|327|[Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/)|[JavaScript](./src/count-of-range-sum/res.js)|Hard|
109110
|334|[Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/)|[JavaScript](./src/increasing-triplet-subsequence/res.js)|Medium|
110111
|342|[Power of Four](https://leetcode.com/problems/power-of-four/)|[JavaScript](./src/power-of-four/res.js)|Easy|

‎src/count-of-smaller-numbers-after-self/res.js

Lines changed: 4 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -18,13 +18,16 @@ var countSmaller = function(nums) {
1818
}
1919

2020
mid=left+parseInt((right-left)/2);
21-
21+
22+
// 计算一下左边
2223
helper(nums,left,mid,indexList)
24+
// 计算一下右边
2325
helper(nums,mid+1,right,indexList)
2426

2527
if(nums[indexList[mid]]<nums[indexList[mid+1]])
2628
return;
2729

30+
// 两个子序列合并
2831
sort_and_count_smaller(nums,left,mid,right,indexList);
2932
}
3033

Lines changed: 22 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
/**
2+
*@param {number[]} nums
3+
*@return {number}
4+
*/
5+
varlengthOfLIS=function(nums){
6+
constlen=nums.length;
7+
if(len<2)returnlen;
8+
9+
constres=nums.map(()=>1);
10+
11+
for(leti=0;i<len;i++){
12+
for(letj=0;j<i;j++){
13+
if(nums[i]>nums[j]){
14+
res[i]=Math.max(res[i],res[j]+1);
15+
}
16+
}
17+
}
18+
19+
letmax=res[0];
20+
res.map(e=>e>max ?max=e:null);
21+
returnmax;
22+
};

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp