319. Bulb Switcher-CSDN博客

本文链接：https://blog.csdn.net/Ellis_hym/article/details/53400853

There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it’s off or turning off if it’s on). For the i_th round, you toggle every _i bulb. For the n_th round, you only toggle the last bulb. Find how many bulbs are on after _n rounds.

Example:

Given _n_ = 3\. 

At first, the three bulbs are **[off, off, off]**.
After first round, the three bulbs are **[on, on, on]**.
After second round, the three bulbs are **[on, off, on]**.
After third round, the three bulbs are **[on, off, off]**. 

So you should return 1, because there is only one bulb is on.

看了discuss之后，心好累。
https://leetcode.com/problems/bulb-switcher/

我的代码：

class Solution(object):
    def bulbSwitch(self, n):

        if not n:return 0
        if n==1:return 1
        ans=0
        i=1
        while i<=n:
            ans+=self.count(i)
            i+=1
        return ans

    def count(self,n):
        i=1
        ans=1
        l=n//2
        while i<=l and i<n:
            if not n%i:ans^=1
            i+=1
        return ans