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;}
}