Ask your own question, for FREE!
MIT 6.00 Intro Computer Science (OCW) 70 Online
OpenStudy (anonymous):

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.

OpenStudy (anonymous):

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.

OpenStudy (anonymous):

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.

OpenStudy (anonymous):

nvm, I've got something I'm happier with.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Latest Questions
JustKOI: a poem just becauuuse...
2 hours ago 5 Replies 10 Medals
madz2345: random stuff from my sketchbook. rate them :0
16 minutes ago 34 Replies 11 Medals
Fredyy: Do you all im doing better!!!pls sub it helps alot!!! thx
28 minutes ago 16 Replies 6 Medals
Tyrun: What y'all think of these lyrics. its sad rap
2 hours ago 10 Replies 2 Medals
lovelygirl13: i made a rick and morty collage
41 minutes ago 24 Replies 9 Medals
DatBoiAYD: art
15 hours ago 14 Replies 6 Medals
Sharkattack123: Congrats on BLUE DEATHHHHHHHH
2 hours ago 17 Replies 6 Medals
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!