问题原文https://leetcode-cn.com/problems/max-consecutive-ones/description/
这道题很简单,不多说。
public int findMaxConsecutiveOnes(int[] nums) {
if(nums.length == 1) {
if(nums[0] == 0) return 0 ;
else return 1;
}
int res = 0;
int[] dp = new int[nums.length];
dp[0] = nums[0] == 1?1:0;
res = dp[0];
for(int i = 1;i<nums.length;i++) {
if(nums[i] == 1) {
if(nums[i] == nums[i-1]) dp[i]+=dp[i-1]+1;
else dp[i] = 1;
}
if(res<dp[i]) res = dp[i];
}
return res;
}