Move Zeroes
来源:互联网 发布:手机航班查询软件 编辑:程序博客网 时间:2024/04/29 12:16
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.
Tags:
Array, Two Pointers
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------
A single loop to check the number of zeroes, so we can re-assign the value of zeroes after moving all the values forward.
/** * @param {number[]} nums * @return {void} Do not return anything, modify nums in-place instead. */var moveZeroes = function(nums) { var start = 0; var i = 0; var len = nums.length; while(start<len) { if(nums[start] !== 0) { nums[i] = nums[start]; i++; } start++; } for(var j=i;j<len;j++) { nums[j] = 0; }};
0 0
- Move Zeroes
- Move Zeroes
- Move Zeroes
- Move Zeroes
- Move Zeroes
- Move Zeroes
- Move Zeroes
- Move Zeroes
- Move Zeroes
- Move Zeroes
- Move Zeroes
- Move Zeroes
- Move Zeroes
- Move Zeroes
- Move Zeroes
- Move Zeroes
- Move Zeroes
- Move Zeroes
- Docker+Kubernetes linux x64 Centos7 安装
- QT编程中的-qws
- css:float之清浮动
- java可视化编程
- 设计模式:(2)抽象工厂(Abstract Factory)
- Move Zeroes
- 寻找单独出现的数——通用技巧
- 缓存类,类似与sharedpreference
- Java程序员必须知道的十个调试技巧
- C语言基础学习
- 用于Activity管理和应用程序退出
- 第七届ACM山东省赛-J Execution of Paladin
- HDU 4366 (dfs序 线段树)
- Redis 2 数据类型之字符串