脚本宝典收集整理的这篇文章主要介绍了283. Move Zeroes,脚本宝典觉得挺不错的,现在分享给大家,也给大家做个参考。
Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.
Note that you must do this in-place without making a copy of the array.
Example 1:
Input: nums = [0,1,0,3,12] Output: [1,3,12,0,0] Example 2:
Input: nums = [0] Output: [0]
Constraints:
1 <= nums.length <= 104 -231 <= nums[i] <= 231 - 1
Follow up: Could you minimize the total number of operations done?
Solution:
class Solution {
public:
void moveZeroes(vector<int>& nums) {
int le = 0;
int ri = 0;
while(ri != nums.size())
{
if(nums[ri] != 0)
{
swap(nums[le], nums[ri]);
le++;
}
ri++;
}
}
};
以上是脚本宝典为你收集整理的283. Move Zeroes全部内容,希望文章能够帮你解决283. Move Zeroes所遇到的问题。
本图文内容来源于网友网络收集整理提供,作为学习参考使用,版权属于原作者。
如您有任何意见或建议可联系处理。小编QQ:384754419,请注明来意。