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

im having some hard time understanding what exactly i have to do in PS3 problem1. Can anyone give me some further explanation? thats what ive done so far allthough is terribly wrong http://dpaste.com/567599/

OpenStudy (anonymous):

ok countSubStringMatch and countSubStringMatchRecurse are two pieces of code that are entirely separate for one two the defintion of recursion is a function that calls itself yours only needs minor tweaking before it starts working try replacing lines 11 and 12 with return [x,] + countSubStringMatchRecurse(target,key,x) and maybe instead of returning None on line 9, you return "[]", an empty list that way your always adding a list together your countSubStringMatch needs a pile of work, but I imagen once you've seperated them you'll figure out what to do

OpenStudy (anonymous):

[OFF TOPIC] enlightenedMinds= ( joz,bwCA) + (Nessman) :D

OpenStudy (anonymous):

Ok. Need some feedback here. How does this look? from string import * http://dpaste.com/569646/ and how im supposed to it in the 2nd way :P

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!
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!