Leetcode: Bulb Switcher



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 nth 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.

更像一个数学思考题。灯如果切换了偶数次是灭的，奇数次才是亮的。怎么样才会是奇数次呢？不妨看看一个数的因子，比如6，因子为1, 2, 3, 6，偶数。两个因子相乘得到结果，所以只有其中的某两个因子相等的时候才会是奇数。这时候这个数是平方数。最终问题归结为求小于等于n的数中有几个平方数。

class Solution {
public:
    int bulbSwitch(int n) {
        int counts = 0;
        for (int i = 1; i * i <= n; ++i) {
            ++counts;
        }
        
        return counts;
    }
};