283. Move Zeroes
来源:互联网 发布:税务数据共享 编辑:程序博客网 时间:2024/06/11 12:26
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:
- You must do this in-place without making a copy of the array.
- Minimize the total number of operations.
将所有的0移到数组的最后,不改变数组最初的顺序,不允许使用复制数组,尽量减少移动
public void moveZeroes(int[] nums) { if(nums == null || nums.length == 0)return; int newIndex = 0;for (int i = 0; i < nums.length; i++) {if (nums[i] != 0) {nums[newIndex++] = nums[i];}}for (; newIndex < nums.length; newIndex++) {nums[newIndex] = 0;} }
0 0
- 283.Move Zeroes
- 283. Move Zeroes
- 283. Move Zeroes
- 283. Move Zeroes
- 283. Move Zeroes
- 【LeetCode】283. Move Zeroes
- 283. Move Zeroes
- 283. Move Zeroes
- Leetcode 283. Move Zeroes
- 283. Move Zeroes
- LeetCode #283. Move Zeroes
- 283. Move Zeroes LeetCode
- 283. Move Zeroes
- LeetCode 283. Move Zeroes
- LeetCode 283. Move Zeroes
- 283. Move Zeroes
- 283. Move Zeroes
- LeetCode 283. Move Zeroes
- 短信验证码自动填写小DOME
- 大数据下的Distinct Count(二):Bitmap篇
- android最简单的生成二维码demo
- Masonry/MASViewConstraint.m:130
- activemq的几种基本通信方式总结
- 283. Move Zeroes
- linux内存中buffer和 cached的比较
- BZOJ1858 [Scoi2010]序列操作
- QPainter
- RISC与CISC
- LeetCode 199 Binary Tree Right Side View
- 斐波那契数列
- 反射机制
- bash的通配符