Just "listing them and counting them", as the other tutor suggests, makes it easy to overlook some solutions or count some solutions more than once.
It is true that there is no (elementary) formal algebraic solution to the problem, so you need to make a list. But do it in an organized way to make sure you count each solution only once.
To make an organized list to find the answer to the problem, instead of listing each number that satisfies the conditions of the problem separately, list each COMBINATION of digits that satisfies the conditions, and determine how many different numbers can be formed with each of those combinations.
And in listing the combinations, make sure each entry in your list has the digits in non-decreasing order. For example, if you have "447" in your list, you don't want to have either "474" or "744" in the list also.
So here we go....
digits # of arrangements
---------------------------
69 2
78 2
159 6
168 6
177 3
249 6
258 6
267 6
339 3
348 6
357 6
366 3
447 3
456 6
555 1
-----------
65
ANSWER: 65
-------------------------------------------------
As pointed out by tutor @ikleyn, my list is not complete -- it does not list 3-digit numbers containing 0 as a digit. To complete the list....
digits # of arrangements
---------------------------
690 4
780 4
-----------
ANSWER (final, corrected): 65+8=73