zoukankan      html  css  js  c++  java
  • 283. Move Zeroes

    题目:

    Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.

    For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0].

    Note:

    1. You must do this in-place without making a copy of the array.
    2. Minimize the total number of operations.

    链接: http://leetcode.com/problems/move-zeroes/

    题解:

    把0都移动到队尾。这道题在Bloomberg的电面里还真被问到过。

    Time Complexity - O(n), Space Complexity - O(1)。

    public class Solution {
        public void moveZeroes(int[] nums) {
            int index = 0;
            for(int i = 0; i < nums.length; i++) {
                if(nums[i] != 0) {
                    nums[index++] = nums[i];
                }
            }
            
            for(int i = index; i < nums.length; i++) {
                nums[i] = 0;
            }
        }
    }

    二刷:

    Java:

    public class Solution {
        public void moveZeroes(int[] nums) {
            if (nums == null) {
                return;
            }
            int index = 0;
            for (int i = 0; i < nums.length; i++) {
                if (nums[i] != 0) {
                    nums[index++] = nums[i]; 
                }
            }
            for (int i = index; i < nums.length; i++) {
                nums[i] = 0;
            }
        }
    }

    三刷:

    先用一个int来count有多少个非0元素,然后把count ~ 数组末尾的所有元素置0.

    Java:

    public class Solution {
        public void moveZeroes(int[] nums) {
            if (nums == null || nums.length == 0) {
                return;
            }
            int nonZeroElemNum = 0;
            for (int i = 0; i < nums.length; i++) {
                if (nums[i] != 0) {
                    nums[nonZeroElemNum++] = nums[i];
                }
            }
            for (int i = nonZeroElemNum; i < nums.length; i++) {
                nums[i] = 0;
            }
            return;
        }
    }

    Update:

    public class Solution {
        public void moveZeroes(int[] nums) {
            if (nums == null || nums.length == 0) return;
            int lo = 0;
            for (int i = 0; i < nums.length; i++) {
                if (nums[i] != 0) nums[lo++] = nums[i];
            }
            for (int i = lo; i < nums.length; i++) nums[i] = 0;
        }
    }

    Reference:

  • 相关阅读:
    (三)字符串、列表、元组、字典
    (二)判断语句和循环语句
    (一)python基础知识
    Python之禅
    《Vue.js实战》一书 p117 练习 1& 2 (2019.12.19)
    React练习 17:02_11_鼠标移过修改图片路径
    React练习 16:02_10_提示框效果
    React练习 15:02_09_单一按钮显示隐藏
    React练习 14:02_08_简易js年历
    React练习 13:02_07_简易选项卡
  • 原文地址:https://www.cnblogs.com/yrbbest/p/5037884.html
Copyright © 2011-2022 走看看