Restricted permutation is considered as important study in combinatorial enumeration. A class of enumerating problems for restricted permutation is studied by using principle of inclusion-exclusion and other combinatorial analysis methods. Some enumerating methods and enumerating formulas for restricted permutation are obtained. These results generalize some known results. Finally

enumerating problem of restricted permutation for future study is given.