For lattice paths in strips which begin at $(0,0)$ and have only up steps $U:(i,j)\to (i+1,j+1)$ and down steps $D:(i,j)\to (i+1,j-1)$, let $A_{n,k}$ denote the set of paths of length $n$ which start at $(0,0)$, end on heights 0 or $-1$, and are contained in the strip $-\lfloor \frac{k+1}{2}\rfloor \le y\le \lfloor \frac{k}{2}\rfloor$ of width $k$, and let $B_{n,k}$ denote the set of paths of length $n$ which start at $(0,0)$ and are contained in the strip $0\le y\le k$. We establish a bijection between $A_{n,k}$ and $B_{n,k}$.

The generating functions for the subsets of these two sets are discussed as well. Furthermore, we provide another bijection between $A_{n,3}$ and $B_{n,3}$ by translating the paths to two types of trees.

对于开始于条带的晶格路径 $（0，0）$ 而且只有一步 $ü：（\mathrm{一世}，Ĵ）\to （\mathrm{一世}+\mathrm{1个}，Ĵ+\mathrm{1个}）$ 上下台阶 $d：（\mathrm{一世}，Ĵ）\to （\mathrm{一世}+\mathrm{1个}，Ĵ-\mathrm{1个}）$，让 ${\mathrm{一种}}_{ñ，ķ}$ 表示长度的路径集 $ñ$ 始于 $（0，0）$，以0或高度结束 $-\mathrm{1个}$，并包含在地带中 $-\lfloor \frac{ķ+\mathrm{1个}}{2}\rfloor \le ÿ\le \lfloor \frac{ķ}{2}\rfloor$ 宽度 $ķ$， 然后让 ${乙}_{ñ，ķ}$ 表示长度的路径集 $ñ$ 始于 $（0，0）$ 并包含在地带中 $0\le ÿ\le ķ$。我们在${\mathrm{一种}}_{ñ，ķ}$ 和 ${乙}_{ñ，ķ}$。

还讨论了这两个集合的子集的生成函数。此外，我们在${\mathrm{一种}}_{ñ，3}$ 和 ${乙}_{ñ，3}$ 通过将路径转换为两种类型的树。