Buttons generator (with DFS) and a reverse_sorting decorator clear solution for The Buttons by Phil15 - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

Buttons generator (with DFS) and a reverse_sorting decorator solution in Clear category for The Buttons by Phil15

reverse_sorting = lambda f: lambda *args: sorted(f(*args), reverse=True)

@reverse_sorting # It's a trivial thing to do that a decorator can do for us.
def buttons(ceiling): # Buttons generator
    ceiling = [[int(k) for k in row] for row in ceiling.strip().splitlines()]
    nb_rows, nb_cols = len(ceiling), len(ceiling[0])
    neighbors = lambda i, j: ((i+I,j+J) for I, J in ((-1,0),(1,0),(0,-1),(0,1))
                                        if 0<=i+I
                        Sept. 23, 2018

                        
                            Comments:
                            
                                
                                    colinmcnicholl
 on Oct. 2, 2018, 6:42 a.m.

                                    <p>A lot of features packed into this code.</p>

<p>First line and we have lambda function, * unpacking operator and keyword arguments on show.</p>

<p>Line 3 and the decorator is being used to customise the buttons function.</p>

<p>Good choice of variable names, e.g. nb<em>rows, nb</em>cols.  These mean that the compact lambda function neighbors is easy to read and it is then clear i refers to rows and j to columns.</p>

<p>I like the use of generator expression on line 11.</p>

<p>Ditto the * unpacking operator on line 19.</p>

<p>Helpful comments lines 15, 16, 17.</p>

                                
                            
                                
                                    Phil15
 on Oct. 3, 2018, 8:58 a.m.

                                    <p>You can see on this I love generators. Next when we only need the first element of a generator (and the use of try except when it's an empty one), and a for loop otherwise. generator comprehension for simples ones, yield generator for complicated ones.</p>

<p>I could do it without the decorator but I really think it's a simple one and can be useful in other contexts. We can have a library of decorators and import it when we need it. Well, in the case of a library, I would write a "sort" decorator taking arguments like</p>

<pre class='brush: python'>@sort(key=..., reverse=...)
</pre>

Escher

0 %

CheckiO ClassRoom Don’t waste any time! Create your first class right now for free and help your students to learn programming more effectively.