The simplest way (I think) is to temporarily ignore the
condition that zero cannot be the first digit.
Find out how many numbers you can get without that condition,
and then subtract the quantity of numbers that violate the condition.
The number of possible ways to list four of the digits $0,2,3,4,$
using each digit only once, is simply the number of ways you can
permute four objects: $4! = 24.$
But among those $24$ sequences of digits are some that start with zero.
The ones that start with zero are all three-digit numbers made of the other three digits $2,3,4.$ There are $3!=6$ ways to arrange the digits
$2,3,4,$ so we must subtract these $6$ ineligible numbers from the
earlier count of $24,$ with the result $24-6=18.$