leetcode

Solution to some Leetcode problems written in C++

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

1089.cpp (649B)

0 class Solution { 1 public: 2 void duplicateZeros(vector<int> &arr) { 3 int cnt = 0; 4 int len = arr.size() - 1; 5 for (int i = 0; i + cnt <= len; i++) 6 if (arr[i] == 0) { 7 if (i + cnt == len) { 8 arr[len] = 0; 9 len -= 1; 10 break; 11 } 12 cnt++; 13 } 14 15 for (int i = len - cnt; i >= 0; i--) { 16 if (arr[i] == 0) { 17 arr[i + cnt] = 0; 18 cnt--; 19 arr[i + cnt] = 0; 20 } else { 21 arr[i + cnt] = arr[i]; 22 } 23 } 24 } 25 };