LeetCode 319. Bulb Switcher（灯泡）

原题网址：https://leetcode.com/problems/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 ith round, you toggle every i bulb. 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.

方法：第n个灯泡最后是否点亮，取决于从1～n有多少个数字能够整除它，但这些因数总是成对出现，例如n=12，则1和12、2和6、3和4，因此它们最后总是熄灭的，除非n是某个数字的平方，即n=i*i，此时i的配对数字就是i自己，只会在这个操作过程中出现一次。

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