Anonymous user
Talk:ABC problem: Difference between revisions
→Examples OK?: Reverting task to null is False.
(→Examples OK?: Reverting task to null is False.) |
|||
Line 12:
::I think you can spell the empty string with zero blocks. So the first test should return true. The reasoning is similar to the Python function all([]) returning True. Another clue comes from the Python iterative solution, that has needed a special case for the empty string. Often in algorithms if you have a special case it needs a special justification.-[[User:Bearophile|bearophile]] ([[User talk:Bearophile|talk]])
:::Hi Bearophile, I think you are premature in your changes. The recursive Python solution has no such special case handling and returns False. ''I will revert your task change pending further discussion''... (P.S. did you read my comments below on the null case)? --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 13:50, 9 January 2014 (UTC)
:Hi, you need one B and two O's but the only blocks with either a B or an O are the ''two'' blocks BO and OB - you can't spell three letters with two blocks! --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 20:30, 8 January 2014 (UTC)
| |||