LeetCode1089. Duplicate Zeros

最新推荐文章于 2023-02-25 23:03:36 发布

katrina95

最新推荐文章于 2023-02-25 23:03:36 发布

阅读量718

点赞数

CC 4.0 BY-SA版权

分类专栏：计算机算法

本文链接：https://blog.youkuaiyun.com/katrina95/article/details/92392474

计算机算法专栏收录该内容

221 篇文章

订阅专栏

本文探讨了一个特定的算法问题：在一个固定长度的整数数组中，如何将每个零元素复制一次，同时将剩余元素向右移动，且不超出原始数组长度。文章通过一个示例详细说明了实现过程，并提供了Java代码解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 <= arr.length <= 10000
0 <= arr[i] <= 9

class Solution {
    public void duplicateZeros(int[] arr) {
        int len = arr.length;
        for (int i = 0; i < len; i++) {
            if (arr[i] == 0) {
                for (int j = len - 1; j >= i+1; j--) {
                    arr[j] = arr[j-1];
                }
                i = i + 1;
            }
        }
        return;
    }
}