283. Move Zeroes
来源:互联网 发布:java初级工程师考试 编辑:程序博客网 时间:2024/06/16 07:21
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.
void moveZeroes(int* nums, int numsSize) { int p = 0; for(int i = 0; i < numsSize; i++) { if(nums[i] != 0) { nums[p++] = nums[i]; } } for(int i = p; i < numsSize; i++) { nums[i] = 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
- Quartz Cron 表达式(二)
- Problem G: 平面上的点和线——Point类、Line类 (VII)
- 10_部署到生产环境
- INFO
- Java 多线程(八) 线程状态图
- 283. Move Zeroes
- 函数闭包
- 面试准备——目录
- Robberies
- Angular Route 总结
- kafka数据可靠性深度解读
- QTableView,Model/View的运用(3),QSortFilterProxyModel
- mybatis映射文件的文件头
- Problem A: 字符的变化