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.

SOLUTION:
#include <iostream>
#include <vector>

using namespace std;

class Solution {
public:
    Solution(){} //缺省构造函数
    int findMaxConsecutiveOnes(vector<int>& nums){ //目标函数的定义
	int n = 0, count_1 = 0, count_2 = 0;
	int sizes = nums.size();
	while(n < sizes){
	    if(nums[n] == 0){
		count_2 = (count_1 > count_2) ? count_1 : count_2;
		count_1 = 0;
		n++;
	    } 
	    else if(nums[n] == 1){
		count_1++;
		n++;
		while(n < sizes && nums[n] != 0) 
		{
		    if(nums[n] == 1) count_1++;
		    n++;
		}
	    }
	}
	return count_2 = (count_1 > count_2) ? count_1 : count_2;
    }
};
int main(){
	Solution p;
        vector<int> n;
	n.push_back(1);
	n.push_back(1);
	n.push_back(0);
	n.push_back(1);
	n.push_back(1);
	n.push_back(1);
	cout << p.findMaxConsecutiveOnes(n) << endl;   // 输出将会是3
}