Move Zeroes Problem


Description

LeetCode Problem 283.

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:

1
2
Input: nums = [0,1,0,3,12]
Output: [1,3,12,0,0]

Example 2:

1
2
Input: nums = [0]
Output: [0]

Constraints:

  • 1 <= nums.length <= 10^4
  • -2^31 <= nums[i] <= 2^31 - 1


Sample C++ Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int len = nums.size();
        int i = 0, j = 0;
        for (i = 0; i < len; i ++) {
            if (nums[i] != 0) {
                nums[j] = nums[i];
                j ++;
            }
        }
        while (j < len) {
            nums[j] = 0;
            j ++;
        }
        return;
    }
};




Related Posts

Find K Closest Elements Problem

LeetCode 658. Given a sorted integer array arr, two integers...

Count Binary Substrings Problem

LeetCode 696. Give a binary string s, return the number...

String Compression Problem

LeetCode 443. Given an array of characters chars, compress it...

Shortest Unsorted Continuous Subarray Problem

LeetCode 581. Given an integer array nums, you need to...

Reverse Words In A String III Problem

LeetCode 557. Given a string s, reverse the order of...

Reverse String II Problem

LeetCode 541. Given a string s and an integer k,...