zoukankan      html  css  js  c++  java
  • 【5_283】Move Zeroes

    终于碰到一道水题,睡觉去~

    Move Zeroes

    Total Accepted: 37369 Total Submissions: 88383 Difficulty: Easy

    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.

    还有一点,我写代码的时候,用C和C++竟然很不熟悉,不如用Java方便。这说明急需复习!

    Java:

     1 public class Solution {
     2     public void moveZeroes(int[] nums) {
     3         for (int i = 0; i < nums.length; i++) {
     4             if (nums[i] == 0)   {
     5                 for (int j = i + 1; j < nums.length; j++)   {
     6                     if(nums[j] != 0) {
     7                         nums[i] = nums[j];
     8                         nums[j] = 0;
     9                         
    10                         break;
    11                     }
    12                 }
    13             }
    14         }
    15             
    16     }
    17 }
  • 相关阅读:
    多态性与转型
    安装tensorflow
    MySQL基础补缺
    各种排序算法理解
    Ubuntu命令行变成白色
    开机显示grub命令
    E: 无法获得锁 /var/lib/dpkg/lock-frontend
    类与方法
    Java语言浅谈
    二进制数的有效讨论
  • 原文地址:https://www.cnblogs.com/QingHuan/p/5041357.html
Copyright © 2011-2022 走看看