I'm really having trouble with Problem 1 in set 3. I'm using the result of a find as my test in the recursive function but it's not working.
def recursion(target, key, ans=()): print find(target,key) if (find(target,key)) ==-1: return ans while find(target,key) != -1: ans += (len(target),) print ans recursion(target[find(target,key)+len(key):], key, ans) is what I'm using, but even when find(target,key) == -1, it still doesn't trigger the following if statement.
I'm using this as a recursive function within my solution. it's meant to return a tuple called ans that lists the successive lengths of the target string as it's shortened. from that I can determine the number of finds in the original string and their locations. I suspect there's a better way, but I'm not that bright.
nvm, I've got something I'm happier with.