485. Max Consecutive Ones

Posted optor

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了485. Max Consecutive Ones相关的知识,希望对你有一定的参考价值。

原题链接:https://leetcode.com/problems/max-consecutive-ones/description/
这道题目级别为easy,实际做起来也是so easy:

/**
 * Created by clearbug on 2018/2/26.
 */
public class Solution {

    public static void main(String[] args) {
        Solution s = new Solution();
        System.out.println(s.findMaxConsecutiveOnes(new int[]{1, 1, 0, 1, 1, 1}));
    }

    public int findMaxConsecutiveOnes(int[] nums) {
        int res = 0;
        for (int i = 0; i < nums.length; i++) {
            int curr = 0;
            while (i < nums.length && nums[i] == 1) {
                curr++;
                i++;
            }
            if (curr > res) {
                res = curr;
            }
            if (i == nums.length) {
                break;
            }
        }

        return res;
    }
}

以上是关于485. Max Consecutive Ones的主要内容,如果未能解决你的问题,请参考以下文章

java 485. Max Consecutive Ones.java

java 485. Max Consecutive Ones.java

java 485. Max Consecutive Ones.java

java 485. Max Consecutive Ones.java

java 485. Max Consecutive Ones.java

java 485. Max Consecutive Ones.java