Leetcode 283. Move Zeroes | | Leetcode 283. Move Zeroes 文章作者:Tyan博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution Version 1 123456789101112131415class Solution {public: void moveZeroes(vector<int>& nums) { int index = 0; for(int i = 0; i < nums.size(); i++) { if(nums[i] != 0) { nums[index] = nums[i]; index++; } } for(int i = nums.size() - 1; i > index - 1; i--) { nums[i] = 0; } }}; Version 2 12345678910111213141516171819class Solution {public: void moveZeroes(vector<int>& nums) { int index = 0; for(int i = 0; i < nums.size(); i++) { if(nums[i] != 0) { swap(nums[i], nums[index]); index++; } } } private: void swap(int& a, int& b) { int temp = a; a = b; b = temp; }}; Reference https://leetcode.com/problems/move-zeroes/description/ 如果有收获,可以请我喝杯咖啡! 赏 微信打赏 支付宝打赏