LeetCode --- 1089. Duplicate Zeros 解题报告
Posted 杨鑫newlfe
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode --- 1089. Duplicate Zeros 解题报告相关的知识,希望对你有一定的参考价值。
Given a fixed-length integer array arr
, 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 and do not return anything.
Example 1:
Input: arr = [1,0,2,3,0,4,5,0] Output: [1,0,0,2,3,0,0,4] Explanation: After calling your function, the input array is modified to: [1,0,0,2,3,0,0,4]
Example 2:
Input: arr = [1,2,3] Output: [1,2,3] Explanation: After calling your function, the input array is modified to: [1,2,3]
Constraints:
1 <= arr.length <= 104
0 <= arr[i] <= 9
所有代码均可在Github中找到&#x
以上是关于LeetCode --- 1089. Duplicate Zeros 解题报告的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode --- 1089. Duplicate Zeros 解题报告
LeetCode --- 1089. Duplicate Zeros 解题报告