283. Move Zeroes
来源:互联网 发布:质量好的淘宝店推荐 编辑:程序博客网 时间:2024/06/17 02:48
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.
public class Solution { public void moveZeroes(int[] nums) { for (int i = 0, j = 0; i < nums.length; i++) { if (nums[i] != 0) { if (i != j) { nums[j] = nums[i]; nums[i] = 0; } j++; } } }}
阅读全文
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
- H
- HDU 3183 A Magic Lamp (RMQ)
- 集合类
- 使用MyBatis Generator自动创建代码
- Hadoop MultipleInputs.addInputPath 读取多个路径
- 283. Move Zeroes
- ubuntu下执行apt-get update 报异常
- 栈在表达式计算过程中的应用
- HPU DFS + BFS 专项练习A
- hdu 5685 2016"百度之星"
- poj 2229 动态规划
- linux 安装jdk1.7
- 多线程下的观察者模式--Java实现
- mybatis-generator 代码自动生成工具