说明：  是一个精典的递归加动态规化的题 题目：有M个苹果要求放入N个篮子中，求出放法的总数（N个篮子中放的苹果数不限定，有的也可以不放）
(Is a classical recursive plus dynamic regulation of the title subject: M has an apple basket request Add N months, the release method to derive the total number (N a basket of apples put a few non-limiting, some can not release))