Hi. I'm working on Problem Set 3.0 (for the fall section). I'm stuck on problem 1 (recursive program to count the number of 'key' strings in a 'target' string). Has anyone found a solution for this? The best I can think of is this...
def MR(target, key):
p = 0
L = len(target)
if L == 1:
if target[(L-2):L] == key:
p = p+1
Which should work except for that my variable p keeps resetting. (Is this the kind of question 'open sudy' is for?)
MIT 6.00 Intro Computer Science (OCW)
Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
Hm, I took your use of the target.find command. But I think you just needed a way to increment your 'target search' - you're searching from the same place every time. This is what I finally came up with... its pretty similar.
def MatchesRecursive(target, key):
p = 0 #number of slices
s = target.find(key, 0)
if s != -1:
p = p+1
p = p + MatchesRecursive(target[s+1:], key)
print target, key, p, s
Maybe I could rewrite it so it doesn't have that p variable and just incremented the number of hits by adding one, like you did?
It should have been:
return countOccurence( target[ foo + 1 : ], key ) + 1
Told you it wasn't tested.