Leetcode 1089. Duplicate Zeros (Python)

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
class Solution(object):
    def duplicateZeros(self, arr):
        """
        :type arr: List[int]
        :rtype: None Do not return anything, modify arr in-place instead.
        """

        list=[]
        for i in range(len(arr)):
            list.append(arr[i])
            if arr[i]==0:
                list.append(0)
            
        if len(list)>len(arr):
            del list[len(arr):]
            
        for i in range(len(arr)):
            arr[i]=list[i]


版权声明:本文为weixin_58080442原创文章,遵循CC 4.0 BY-SA版权协议,转载请附上原文出处链接和本声明。