【LeetCode】485. Max Consecutive Ones（最大连续数之和）

【LeetCode】485. Max Consecutive Ones（最大连续数之和）
题目链接：https://leetcode.com/problems/max-consecutive-ones/description/
难度：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 {
public int findMaxConsecutiveOnes(int[] nums) {
int max=0;
int sum=0;
for(int i=0;i<nums.length;i++)
{
if(nums[i]==1)
{
sum++;
if(sum>=max)
max=sum;
}
else {
sum=0;
}

}
return max;
}
}

日期：2018/2/23-19:46