递归返回我在j中出现的位置数组

I am not good at Java so I just would like to say in advance "THIS IS MY HOMEWORK" and please "DO NOT DO MY HOMEWORK", this is the very first homework on recursion so this is my first time. Having said that, these are the instructions of my homework but I am not sure the steps that I need to take in order to achieve the goal. All I need is a great guy/girl who can give me good details on how to finish my homework, kind of steps. I have read the book, checked some websites about recursion, but I feel that I need a little more help. I am not good at Java so I just would like to s