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

Commit85eedb0

Browse files
committed
update: 128
1 parent52ce0ac commit85eedb0

File tree

2 files changed

+29
-0
lines changed

2 files changed

+29
-0
lines changed

‎README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -50,6 +50,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
5050
|122|[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/)|[JavaScript](./src/best-time-to-buy-and-sell-stock-ii/res.js)|Easy|
5151
|123|[Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/) <sup>*</sup>|[JavaScript](./src/best-time-to-buy-and-sell-stock-iii/res.js)|Hard|
5252
|127|[Word Ladder](https://leetcode.com/problems/word-ladder/)|[JavaScript](./src/word-ladder/res.js)|Medium|
53+
|128|[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)|[JavaScript](./src/longest-consecutive-sequence/res.js)|Medium|
5354
|130|[Surrounded Regions](https://leetcode.com/problems/surrounded-regions/)|[JavaScript](./src/surrounded-regions/res.js)|Medium|
5455
|133|[Clone Graph](https://leetcode.com/problems/clone-graph/)|[JavaScript](./src/clone-graph/res.js)|Medium|
5556
|134|[Gas Station](https://leetcode.com/problems/gas-station/)|[JavaScript](./src/gas-station/res.js)|Medium|
Lines changed: 28 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
/**
2+
*@param {number[]} nums
3+
*@return {number}
4+
*/
5+
varlongestConsecutive=function(nums){
6+
constnumMap={};
7+
letlongest=0;
8+
9+
nums.forEach(e=>numMap[e]=true);
10+
11+
nums.forEach(e=>{
12+
if(!numMap[e-1]){
13+
letcurNum=e;
14+
letcurLen=1;
15+
16+
while(numMap[curNum+1]){
17+
curNum++;
18+
curLen++;
19+
}
20+
21+
if(curLen>longest){
22+
longest=curLen;
23+
}
24+
}
25+
});
26+
27+
returnlongest;
28+
};

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp