Leetcode刷题记录[java]——485 Max Consecutive Ones

标签：最大   遍历   inpu   集群   osi   ret   this   ons   his   

一、前言

二、题485 Max Consecutive Ones

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的情况计数，与当前最大的1的集群比较，返回较大值，最后结果即为最大值。

 1 class Solution {
 2     public int findMaxConsecutiveOnes(int[] nums) {
 3         int result = 0;
 4         int count = 0;
 5         for (int i=0; i<nums.length; i++) {
 6             if (nums[i] == 1) {
 7                 count++;
 8                 result = Math.max(count, result);
 9             }
10             else count = 0;
11         }
12         return result;
13     }
14 }

Leetcode刷题记录[java]——485 Max Consecutive Ones

标签：最大   遍历   inpu   集群   osi   ret   this   ons   his   

原文地址：http://www.cnblogs.com/Myoungs/p/7833267.html