283. Move Zeroes
来源:互联网 发布:英语有声阅读软件 编辑:程序博客网 时间:2024/06/06 02:36
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.
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
其实可以考虑改一下传统的排序方法进行计算。我是基于冒泡排序进行了改进。
class Solution { public void moveZeroes(int[] nums) { int temp; for (int i = 0; i < nums.length-1; i++){ for(int j = 0; j < nums.length-1-i; j++){ if(nums[j] == 0 && nums[j+1] != 0){ temp = nums[j]; nums[j] =nums[j+1]; nums[j+1] = temp; } } } }}
阅读全文
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
- Java wait() notify()方法使用实例讲解
- 怎么搭建一款合同管理系统
- 两台Linux系统之间传输文件的几种方法
- 判断Laravel Eloquent获取数据结果集是否为空
- HashMap的实现
- 283. Move Zeroes
- php bz2扩展安装
- html常见兼容性问题(来自牛客网)
- ubuntu samba安装
- HDU 4336 Card Collector 动态规划-概率DP
- UML统一建模语言简介及使用
- vuejs+bootstrap实现简易的留言板功能
- linux下I2C驱动架构全面分析
- HttpModule与HttpHandler详解