-
Notifications
You must be signed in to change notification settings - Fork 2
/
485.最大连续1的个数.html
58 lines (48 loc) · 1.48 KB
/
485.最大连续1的个数.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8" />
<meta http-equiv="X-UA-Compatible" content="IE=edge" />
<meta name="viewport" content="width=device-width, initial-scale=1.0" />
<title>485. 最大连续 1 的个数</title>
</head>
<body>
<script>
// https://leetcode-cn.com/problems/max-consecutive-ones/
// 给定一个二进制数组 nums , 计算其中最大连续 1 的个数。
// 提示:
// 1 <= nums.length <= 105
// nums[i] 不是 0 就是 1.
/**
* @param {number[]} nums
* @return {number}
*/
var findMaxConsecutiveOnes = function (nums) {};
// --- answer-1 ---
var findMaxConsecutiveOnes = function (nums) {
let max = 0;
let temp = 0;
for (let n of nums) {
if (n === 1) {
temp += 1;
} else {
max = Math.max(max, temp);
temp = 0;
}
}
return Math.max(max, temp);
};
// --- answer-1 ---
// --- answer-2 ---
// --- answer-2 ---
var nums = [1, 1, 0, 1, 1, 1];
var result = 3;
// 解释:开头的两位和最后的三位都是连续 1 ,所以最大连续 1 的个数是 3.
var nums = [1, 0, 1, 1, 0, 1];
var result = 2;
console.log('nums = ', nums);
console.log('result = ', result);
console.log('findMaxConsecutiveOnes = ', findMaxConsecutiveOnes(nums));
</script>
</body>
</html>