(2) Two steps, there are two ways, 1+ 1 or direct 2.

③ Three steps,

The first step is 1, and there are 2 left. According to ②, there are still two ways to go.

The first step is to take 2, leaving 1. It can be seen from ① that there are 1 moves.

A * * *: 1+2 = 3 mobile modes.

④ Four steps

The first step is 1, and there are 3 left. It can be seen from ③ that there are still three ways to go.

The first step is 2, and there are 2 left. According to ②, there are two other methods.

The first step is to take 3, leaving 1. According to ①, there are still 1 roads to go.

A * * *: 1+2+3 = 6 strokes.

⑤ It can be obtained in the same way.

Five steps: 6+3+2= 1 1.

Six steps: 1 1+6+3=20.

......

Get a series as follows:

1,2,3,6, 1 1,20,37,68, 125,230

If there is a 10 step, there are 230 different ways to walk.

If there is a level of 100, it seems that it is not easy to calculate without computer programming.