一次学习python的代码道场解题记录

为什么80%的码农都做不了架构师？>>>   

http://cyber-dojo.org/kata/edit/58EDF53913?avatar=toucan

 def doors_init(self):
        doors = []
        for i in range(100):
            doors.append(0)
        print doors
        return doors

    def doors_play_index(self,n,max):
        '''
        n = 1: [1,2,3]->[0,1,2]
        n = 2: [2,4,6]->[1,3,5]
        n = 3: [3,6,9]->[2,5,8]
        ......
        '''
        indexs = []
        i = n
        while (i-1) < max:
            indexs.append(i - 1)
            i = i + n
        return indexs
    
    def play(self,n):
        doors = self.doors_init()
        for count in range(1,n + 1):
            for index in self.doors_play_index(count,100):
                if doors[index] == 0:
                    doors[index] = 1
                else:
                    doors[index] = 0
        print doors
        return doors

如果看到这个代码的人有兴趣，请帮我改进此代码，并给我留言。

转载于:https://my.oschina.net/janl/blog/685224