leetcode-485-Max Consecutive Ones

Input: [1,1,0,1,1,1]
Output: 3
Explanation: The first two digits or the last three digits are consecutive 1s.
    The maximum number of consecutive 1s is 3.

    int findMaxConsecutiveOnes(vector<int>& nums) 
    {
        int i=0,j=0,s1=nums.size(),count,result=0;
        while(i<s1)
        {
            if(nums[i]==1)//如果当前数值为1，那么进入处理
            {
                count=1;//初始化count为1，表示当前有一个1
                j=i+1;//从i的下一个数开始判断
                while(j<s1)
                {
                    if(nums[j]==1)
                    {
                        count++;
                        j++;
                    }  
                    else
                        break; 
                }
                i=j+1;//更新i的值
                result=max(result,count);//更新result的值
            }
            else
                i++;
        }
        return result;
    }