283. Move Zeroes
来源:互联网 发布:网络事件对社会的影响 编辑:程序博客网 时间:2024/05/22 14:38
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.
这个题目用JS的
splice
函数也是非常方便的。
/** * @param {number[]} nums * @return {void} Do not return anything, modify nums in-place instead. */var moveZeroes = function(nums) { var i=0; for(var j=0;j<nums.length;j++){ if(nums[i]===0){ nums.splice(i,1); nums.splice(nums.length,0,0); } else i++; } //return nums;};
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
- 海量数据处理2
- http1 & http2 发展与特性
- Centos7安装Tomcat
- RecyclerView实现复杂首页(条目)布局
- 编译php7.0.17报错提示 undefined reference to `libiconv_open'
- 283. Move Zeroes
- [Android]备忘在Fragment获取高度(基本不起作用,有条件的起作用,有待改进)
- 欢迎使用CSDN-markdown编辑器
- lintcode(406)和大于S的最小子数组
- 读者写者问题
- OpenLDAP初学习
- oj26. Remove Duplicates from Sorted Array
- Reac native (1) 环境搭建
- 隐写分析中容易犯的小错误