Example 2 As shown in Figure 2 of the hopscotch game: a person can only enter the first
square from outside; in the squares, each time they can
jump forward 1 square or 2 squares.
Then, the number of ways a person can jump
from outside to the sixth square is $\qquad$.
Solution 1 (Enumeration Method) Transform the problem as follows:
Enter the 6th grid from the 1st grid, walking 5 grids. Represent the number 5 as the sum of several 1s or 2s, where different orders of 1s and 2s represent different methods (e.g., $5=1+1+1+1+1$). For convenience, abbreviate the expression to $5=11111$. Then, decompose 5 in the following ways:
$$
\begin{array}{l}
5=11111=1112=1121=1211 \\
=2111=122=221=212,
\end{array}
$$

There are 8 methods in total.
Solution 2 (Recursive Method) Consider the number of ways to enter the $n$-th grid, denoted as $F_{n}$. It is easy to see that $F_{1}=1, F_{2}=1$ (Note: a person can only enter the first grid from outside the grid). For $n \geqslant 3$, the number of ways to enter the $n$-th grid, $F_{n}$, can be divided into two categories: taking one step from the $(n-1)$-th grid; taking two steps from the $(n-2)$-th grid. Therefore,
$$
F_{n}=F_{n-1}+F_{n-2} \text {, }
$$

This is a Fibonacci sequence. Extracting $F_{6}=8$ gives the answer to this problem.