Python describe LeetCode 1089. Copy zero

Hello everyone , I'm Qi Guanjie （qí guān jié ）, stay 【 Qi Guanjie 】 official account 、CSDN、GitHub、B Share some technical blog posts on the website and other platforms , It mainly includes front-end development 、python The backend development 、 Applet development 、 Data structure and algorithm 、docker、Linux Common operation and maintenance 、NLP And other related technical blog , Time flies , Future period , come on. ~

If you love bloggers, you can focus on the bloggers' official account. 【 Qi Guanjie 】(qí guān jié), The articles inside are more complete and updated faster . If you need to find a blogger, you can leave a message at the official account. , I will reply to the message as soon as possible .

---

This article was originally written as 【 Qi Guanjie 】（qí guān jié ）, Please support the original , Some platforms have been stealing blog articles maliciously ！！！ All articles please pay attention to WeChat official account 【 Qi Guanjie 】.

subject

Give you a fixed length array of integers arr, Please copy every zero that appears in the array , And shift the rest of the elements to the right .

Be careful ： Please do not write elements beyond the length of the array .

requirement ： Please input the array In situ Make the above modifications , Don't return anything from a function .

Example 1：

 Input ：[1,0,2,3,0,4,5,0]
Output ：null
explain ： After calling the function , The input array will be modified to ：[1,0,0,2,3,0,0,4]

Example 2：

 Input ：[1,2,3]
Output ：null
explain ： After calling the function , The input array will be modified to ：[1,2,3]

Tips ：

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

Python describe

class Solution:
def duplicateZeros(self, arr: List[int]) -> None:
""" Do not return anything, modify arr in-place instead. """
n = len(arr)
i = 0
while i < n:
if arr[i] == 0:
j = n -1
while i < j:
arr[j] = arr[j-1]
j -= 1
i += 1
i += 1