zoukankan      html  css  js  c++  java
  • LeetCode 283

    Move Zeros

    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.
     1 public class Solution {
     2     public void moveZeroes(int[] nums) {
     3         int a = 0;
     4         int b = 0;
     5         for(int i = 0 ; i < nums.length ; i++){
     6             if( nums[i] == 0 ){
     7                 a++;
     8             }else{
     9                 nums[b] = nums[a];
    10                 a++;
    11                 b++;
    12             }
    13         }
    14         while(b < nums.length){
    15             nums[b]=0;
    16             b++;
    17         }
    18     }
    19 }
  • 相关阅读:
    王道训练营-C语言-1
    错排问题
    王道训练营-C语言-1
    图文处理 生成海报
    根据经纬度按距离排序
    vue总结
    docker+consul
    doker es
    知识库
    php笔记
  • 原文地址:https://www.cnblogs.com/Juntaran/p/5428855.html
Copyright © 2011-2022 走看看