Move Zeroes

Problem

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 <= 10^4
  • -2^31 <= nums[i] <= 2^31 - 1

Follow up: Could you minimize the total number of operations done?

Solution

O(n) time/space solution. Sloppy code, though.

class Solution {
    public void moveZeroes(int[] nums) {
        var firstSlot = -1;

        for (int i = 0; i < nums.length; i++) {
            if (nums[i] == 0) {
                firstSlot = i;
                break;
            }
        }

        if (firstSlot == -1) {
            return;
        }

        var nextSlot = firstSlot;
        for (int i = 0; i < nums.length; i++) {
            if (i < firstSlot) {
                continue;
            }

            if (nums[i] != 0) {
                nums[nextSlot] = nums[i];
                nums[i] = 0;
                nextSlot += 1;
            }
        }
    }
}

Recent posts from blogs that I like

Paintings of the Franco-Prussian War: 2 The Siege of Paris

As winter grew colder, Parisians started to starve. A city known for its food and restaurants had to scavenge meals based on horse, dog, cat and even rat.

via The Eclectic Light Company

Impromptu disaster recovery

via fasterthanlime

Notes on implementing Attention

Some notes on implementing attention blocks in pure Python + Numpy. The focus here is on the exact implementation in code, explaining all the shapes throughout the process. The motivation for why attention works is not covered here - there are plenty of excellent online resources explaining it. Seve...

via Eli Bendersky