Day 18 leetcode 移动零

最新推荐文章于 2024-10-08 16:45:42 发布

cumt-nku-ting

最新推荐文章于 2024-10-08 16:45:42 发布

阅读量152

点赞数

分类专栏： leetcode 文章标签： leetcode 算法数据结构

本文链接：https://blog.csdn.net/weixin_46271668/article/details/128070593

版权

leetcode 专栏收录该内容

24 篇文章 1 订阅

订阅专栏

Day 18

题目：移动零

leetcode链接：移动零
要点：快慢双指针

1、Java

class Solution {
    public void moveZeroes(int[] nums) {
        int slow = 0;
        int fast = 0;
        while(fast < nums.length){
            if(nums[fast] != 0){
                int tmp = nums[fast];
                nums[fast] = nums[slow];
                nums[slow] = tmp;
                slow++;
            }
            fast++;
        }
    }
}

2、python

class Solution:
    def moveZeroes(self, nums: List[int]) -> None:
        """
        Do not return anything, modify nums in-place instead.
        """
        slow = 0
        fast = 0
        while(fast < len(nums)):
            if(nums[fast] != 0):
                nums[slow] = nums[fast]
                slow = slow + 1
            fast = fast + 1
        while(slow < len(nums)):
            nums[slow] = 0
            slow = slow + 1