leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

3191.cpp (401B)

0 class Solution { 1 public: 2 int minOperations(vector<int> &nums) const { 3 const int n = size(nums); 4 int res = 0; 5 6 for (int i = 0; i < n - 2; i++) { 7 if (nums[i]) continue; 8 nums[i + 1] = !nums[i + 1]; 9 nums[i + 2] = !nums[i + 2]; 10 res++; 11 } 12 13 if (!nums[n - 2] || !nums[n - 1]) return -1; 14 return res; 15 } 16 };