Skip to content

Commit f89e182

Browse files
authored
feat: Add javascript Solution for 485 (#86)
1 parent 9dd58ac commit f89e182

File tree

2 files changed

+22
-2
lines changed

2 files changed

+22
-2
lines changed

README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -525,7 +525,7 @@ _If you like this project, please leave me a star._ ★
525525
|488|[Zuma Game](https://leetcode.com/problems/zuma-game/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_488.java) | |Hard | DFS, Backtracking
526526
|487|[Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_487.java) | |Medium| Array
527527
|486|[Predict the Winner](https://leetcode.com/problems/predict-the-winner/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_486.java) | | Medium | DP
528-
|485|[Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_485.java) | |Easy| Array
528+
|485|[Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones/)|[Java](../master/src/main/java/com/fishercoder/solutions/_485.java) [Javascript](../master/javascript/_485.js)| |Easy| Array
529529
|484|[Find Permutation](https://leetcode.com/problems/find-permutation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_484.java) | |Medium | Array, String, Greedy
530530
|483|[Smallest Good Base](https://leetcode.com/problems/smallest-good-base/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_483.java) | |Hard | Binary Search, Math
531531
|482|[License Key Formatting](https://leetcode.com/problems/license-key-formatting/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_482.java) | |Medium|
@@ -983,7 +983,7 @@ _If you like this project, please leave me a star._ ★
983983
|4|[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_4.java) | |Hard | Divide and Conquer
984984
|3|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_3.java) | |Medium | HashMap, Sliding Window
985985
|2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_2.java) | |Medium | LinkedList
986-
|1|[Two Sum](https://leetcode.com/problems/two-sum/)|[Java](../master/src/main/java/com/fishercoder/solutions/_1.java), [C++](../master/cpp/_1.cpp), [javascript](../master/javascript/_1.js)|[:tv:](https://www.youtube.com/watch?v=kPXOr6pW8KM&t=)|Easy| HashMap
986+
|1|[Two Sum](https://leetcode.com/problems/two-sum/)|[Java](../master/src/main/java/com/fishercoder/solutions/_1.java), [C++](../master/cpp/_1.cpp), [Javascript](../master/javascript/_1.js)|[:tv:](https://www.youtube.com/watch?v=kPXOr6pW8KM&t=)|Easy| HashMap
987987

988988
## Database
989989

javascript/_485.js

+20
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
var findMaxConsecutiveOnes = function(nums) {
2+
3+
let slow = 0
4+
let fast = 0
5+
let max = 0
6+
while(fast < nums.length){
7+
if(nums[fast] === 0){
8+
if(fast - slow > max ) {
9+
max = fast - slow
10+
}
11+
fast++;
12+
slow = fast
13+
} else {
14+
fast++
15+
}
16+
}
17+
return fast - slow > max ? fast - slow : max
18+
19+
}
20+

0 commit comments

Comments
 (0)