485. Max Consecutive Ones【easy】

485. Max Consecutive Ones【easy】

Given a binary array, find the maximum number of consecutive 1s in this array.

Example 1:

Input: [1,1,0,1,1,1]
Output: 3
Explanation: The first two digits or the last three digits are consecutive 1s.
    The maximum number of consecutive 1s is 3.

 

Note:

• The input array will only contain 0 and 1.
• The length of input array is a positive integer and will not exceed 10,000

 

 解法一：

 1 class Solution {
 2 public:
 3     int findMaxConsecutiveOnes(vector<int>& nums) {
 4         int max = 0;
 5         int temp = 0;
 6         
 7         for (int i = 0; i < nums.size(); ++i)
 8         {
 9             if (nums[i] == 1)
10             {                                
11                 temp++;
12                 max = temp > max ? temp : max;
13             }
14             else
15             {             
16                 temp = 0;
17             }
18         }
19         
20         return max;
21     }
22 };

思路很简单：是1就累加并且判断是否需要更新max，不是1就把累加和归为0，继续遍历。

 

解法二：

1 public int findMaxConsecutiveOnes(int[] nums) {
2         int maxHere = 0, max = 0;
3         for (int n : nums)
4             max = Math.max(max, maxHere = n == 0 ? 0 : maxHere + 1);
5         return max; 
6     } 

大神解释如下：

 

The idea is to reset maxHere to 0 if we see 0, otherwise increase maxHere by 1
The max of all maxHere is the solution

110111
^ maxHere = 1

110111
.^ maxHere = 2

110111 ..^ maxHere = 0 110111 ...^ maxHere = 1 110111 ....^ maxHere = 2 110111 .....^ maxHere = 3

 

解法三：

 1 int findMaxConsecutiveOnes(int* nums, int numsSize) {
 2  int max = 0;
 3  int sum = 0;
 4  for (int i=0; i<numsSize; i++)
 5  {
 6      sum = (sum+nums[i])*nums[i];
 7      if(max<sum){max=sum;}
 8  }
 9 return max;
10 }

这方法更牛逼，大神解释如下：Use the fact that multiplication with 0 resets everything..

 

转载于:https://www.cnblogs.com/abc-begin/p/7536609.html