Very concise code.. should read !!! From https://leetcode.com/problems/max-consecutive-ones/#/description
public class Solution {
public int findMaxConsecutiveOnes(int[] nums) {
int sum =0;
int ans =0;
for (int n : nums){
sum = n==0 ? 0 : sum + 1; // right
// sum = n==0 ? 0 : ++sum; // right
// sum = n==0 ? 0 : sum++; // wrong
ans = Math.max(ans, sum);
}
return ans;
}
}