LeetCode: 485 Max Consecutive Ones(easy)

题目：

Given a binary array, find the maximum number of consecutive 1s in this array.

Example 1:

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.

Note:

• The input array will only contain 0 and 1.
• The length of input array is a positive integer and will not exceed 10,000

代码：

别人的：

 class Solution {
 public:
     int findMaxConsecutiveOnes(vector<int>& nums) {
         int count = , max = ;
         for (int i = ; i < nums.size(); i++) {
             if (nums[i] ==  && (!i || nums[i - ] != )) count = ;
             else if (i && nums[i] ==  && nums[i - ] == ) count++;
             if (max < count) max = count;
         }
         if (max < count) max = count;
         return max;
     }
 };

自己的：

 class Solution {
 public:
     int findMaxConsecutiveOnes(vector<int>& nums) {
         int result = ;
         int tem = ;
         nums.push_back();
         for (auto c : nums){
             if(c == ){
                 if ( tem > result)
                     result = tem;
                 tem = ;
             }
             else
                 tem++;
         }
         return result;
     }
 };