解题思路:
(1)向右移动数组
class Solution {
public:
void duplicateZeros(vector<int>& arr) {
int i=0;
while(i<arr.size()) {
if(arr[i]==0) {
for(int j=arr.size()-1;j>=i+2;j--)
arr[j]=arr[j-1];
if(i+1<arr.size()) arr[i+1]=0;
i+=2;
} else i++;
}
}
};