Help with Recursive solution,list items

[gianniskampanakis]

Hi. This exercise was at the first exam of my university but I cant solve it. It needs to make a function using recursion. We have for example a list like [1,1,1,1] and we need to check if the items in list appear only one time. Example: [1,1,1,1] function has to return True. [1,2,3] has to return False . [1,1,2,2] True . [1,1,2,3] false.

[buran]

we are glad to help but we are not going to do it for you. Post your code in python tags, any error traceback - in error tags and in full. Also post the assignment verbatim (your current example is contradicting - how passing [1, 1, 1, 1] to function will return True (i.e. items in list appear only one time) when the item 1 appears 4 times)... why [1, 1, 2, 2] will return True and [1, 1, 2, 3] will return False?

[gianniskampanakis]

I am sorry. I mean if every item in list appears more than one time then it is true. I am glad to try solve this and I really tried. I can solve the problem but not with recursive function because I cant understand exactly what to do with list. I will be very happy if you give me some tips to do it my own

[buran]

So far you haven't show any effort. This is not going to work like this...

[gianniskampanakis]

def allSames(l):
Value= True
for i in l:
if l.count(i) < 2:
Value = False
return Value

This is my programme but with no recursion. Excuse me but I write this from my phone and I cant give the cod in python box. If it is not enough give me some time and I definatly will provide the code in python box as fast as I find a pc

[ndc85430]

Do you know how recursion works?

[ibreeden]

First try to write the program without recursion. Show us your code (and error message). (You must use BBcode) Then we will help you to make a recursive function out of it.

[jefsummers]

Took your phone code and properly formatted, and you are right, it works. Now the challenge is to do it with recursion. Here is your code formatted so all can more easily visualize (with an example at the end)

def allSames(l):
    Value= True
    for i in l:
        if l.count(i) < 2:
            Value = False
    return Value
print(allSames('1112233344'))

Output:
True

Now for recursion - your solution is more elegant than the recursive one will be. Forget that l.count(i) is available. In its place write code that includes a call back to the original function (that call back makes it recursive).
Or, another idea - do a count on the first digit. If 2+, remove all copies of that digit and call the function on the resulting string (this is the recursion part). Return if either out of digits or if any digit has a count of 1.

[gianniskampanakis]

Thanks for the advice. In some hours I will finally be in front of a pc and I will try it more.and i will upload my result