1, adjacent problem binding method:

The title stipulates that several adjacent elements are bound into a group and arranged into a large element.

2. Interpolation method for phase separation problem;

Elements are separate (that is, they are not adjacent). First, several elements without position requirements are completely arranged, and then the specified separation elements are inserted into the gaps and both ends of the above elements.

3. Simplified method of sequencing problem:

In the arrangement problem, some elements need to be limited to a certain order, and the method of reducing multiples can be used.

4, label grading problem step by step:

Arranging elements in the specified position can be done by arranging one element first, then arranging another element in the second step, and so on.

5, orderly distribution problem point by point method:

Orderly allocation problem refers to dividing elements into several groups, which can be grouped step by step.

6, multivariate problem classification:

There are many factors, and there are also many situations that can be taken out. According to the requirements of the results, they can be divided into incompatible situations and counted separately, and finally aggregated.

7, cross problem setting method:

In some permutation and combination problems, several parts intersect, so we can use the formula to find the number of elements in the set.

8, positioning problem priority method:

To arrange one or several elements in a specified position, you can arrange them first; Arrange other elements.

9, multi-row problem single row method:

The problem of arranging elements into several lines can be summed up as one line and then processed in sections.