mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-04 16:12:47 +08:00
54 lines
1.5 KiB
Markdown
54 lines
1.5 KiB
Markdown
# [1089. Duplicate Zeros](https://leetcode.com/problems/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`
|
||
|
||
## 题目大意
|
||
|
||
给你一个长度固定的整数数组 arr，请你将该数组中出现的每个零都复写一遍，并将其余的元素向右平移。注意：请不要在超过该数组长度的位置写入元素。要求：请对输入的数组 就地 进行上述修改，不要从函数返回任何东西。
|
||
|
||
|
||
## 解题思路
|
||
|
||
- 给一个固定长度的数组，把数组元素为 0 的元素都往后复制一遍，后面的元素往后移，超出数组长度的部分删除。
|
||
- 简单题，按照题意，用 append 和 slice 操作即可。
|
||
|
||
## 代码
|
||
|
||
```go
|
||
func duplicateZeros(arr []int) {
|
||
for i := 0; i < len(arr); i++ {
|
||
if arr[i] == 0 && i+1 < len(arr) {
|
||
arr = append(arr[:i+1], arr[i:len(arr)-1]...)
|
||
i++
|
||
}
|
||
}
|
||
}
|
||
``` |