[LeetCode]Max Consecutive Ones

很简单的题，不多说，代码如下：

	class Solution {
	public:
	int findMaxConsecutiveOnes(vector<int>& nums) {
	int len = nums.size(), localMax = 0, globalMax = 0;
	for(int i = 0; i < len; ++i)
	{
	if(nums[i])
	++localMax;
	else
	localMax = 0;
	globalMax = max(localMax, globalMax);
	}
	return globalMax;
	}
	};

view raw Max Consecutive Ones.cpp hosted with ❤ by GitHub