Max Consecutive Ones

class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        int max_so_far=0;
        int counter=0;
        int n=nums.size();
        for(int i=0;i<n;i++)
        {
           counter=counter+nums[i];
            if(nums[i]==0)
                counter=0;

            max_so_far = max(max_so_far,counter);

         }
         return max_so_far;
    }
};