283. Move Zeroes
来源:互联网 发布:人工智能三贤者理论 编辑:程序博客网 时间:2024/06/06 03:32
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.
方法很巧妙。
class Solution {public: void moveZeroes(vector<int>& nums) { int idx = 0; int len = nums.size(); for(int i = 0; i < len; i++) { if(nums[i] != 0) { nums[idx++] = nums[i]; } } for(int i = idx; i < len; 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
- 习题 3.1 小结
- ubuntu14.04 下flash_tool问题
- 理论讲解TCP 与UDP的编程步骤
- UI
- 2016-6-27 杂感
- 283. Move Zeroes
- Codeforces 686 D Kay and Snowflake (树重心)
- 3Sum Closest
- 32位 plsql连接 64位Oracle教程
- Android自定义组合控件
- Android面试总结
- GibbsLDA utils.cpp分析
- 进程间的通信方式(二)
- 算法导论_第五章_概率分析和随机算法