leetcode

0 class Solution {

1 public:

2 int longestSubarray(const vector<int> &nums) {

3 int res = 0, left = 0, zero = -1, i;

4 for (i = 0; i < nums.size(); i++) {

5 if (nums[i]) continue;

6 res = max(res, i - left);

7 left = zero + 1;

8 zero = i;

9 }

10 return max(res, i - left) - 1;

11 }

12 };