Shulou(Shulou.com)06/01 Report--

This article mainly introduces LeetCode how to solve the mobile zero problem, the article is very detailed, has a certain reference value, interested friends must read it!

one

Topic description

Given an array nums, write a function to move all zeros to the end of the array while maintaining the relative order of non-zero elements. For example, enter [0BZ] and return [1], and note that the order of other elements remains the same.

two

Answer to the question

Idea: problems such as double pointers can be solved by double pointers, with one pointer pointing from the left to the current target element and the other pointing from the right to the back of the unjudged element. When the left pointer is 0, remove the element and add 0 after the array, which means that the element in the middle of the two pointers moves to the left, while the left pointer moves backward and the right pointer moves forward. If the left and right pointers point to the same element, the judgment ends. For similar questions, see LeetCode exercise DAY 24: remove elements. Class Solution: def moveZeroes (self, nums: List [int])-> None: "" Do not return anything, modify nums in-place instead. "" I = 0 j = len (nums) while I

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.