[Leetcode] Duplicate Zeros

Given a fixed length array arr of integers, duplicate each occurrence of zero, shifting the remaining elements to the right.

Note that elements beyond the length of the original array are not written.

Do the above modifications to the input array in place, do not return anything from your function.

 

Example 1:

Input: [1,0,2,3,0,4,5,0]

Output: null

Explanation: After calling your function, the input array is modified to: [1,0,0,2,3,0,0,4]

Example 2:

Input: [1,2,3]

Output: null

Explanation: After calling your function, the input array is modified to: [1,2,3]

 

Note:

1. 1 <= arr.length <= 10000
2. 0 <= arr[i] <= 9

 

[ 내 코드 ]

class Solution {
public:
	void duplicateZeros(vector<int>& arr)
	{
		size_t size = arr.size();

		for (int i = 0; i < size - 1; i++)
		{
			if (arr[i] == 0)
			{
				for (int j = size - 2; j >= i; j--)
				{
					arr[j + 1] = arr[j];
				}

				i++;
			}			
		}
	}
};

 

- 똑같은 값이 삽입되어야 하는데, 뒤에서부터 밀어야 함에 유의해야 한다.