dreamjay1997的博客

function getArrayDepth(arr) { const depths = [] arr.forEach( ele => { let depth = 0 if (Array.isArray(ele)) { depth = getArrayDepth(ele) } depths.push(depth) }) retur...

4:Placing apples 总Time Limit: 1000msMemory Limit: 65536kB Description We are going to place M same apples into N same plates. There could be some empty plates. How many methods do we have? Whe

输入数字n，表示有n个盘子,问有多少种可能？并输出每一步的方法 #include char x='x',y='y',z='z'; int num=0; void hanio(int n,char x, char y,char z) {     if(n==1){         printf("%d move %d from %c to %c\n",++num,n,x,z);

How far away ？ Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 19131    Accepted Submission(s): 7485 Problem Description There are n ho