[LC319] Bulb Switcher

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

这题与其说是算法题，不如说是一道数学题，更注重找规律。

举例说灯泡序号6，最早的状态是所有灯都点亮，在round 2它将被熄灭，在 round 3它将被点亮，在round 6时候又被熄灭，后续的 round 将不会被触发。所以可以发现k 将取决于有多少个factor，可以发现，包括了1以后，所有数字都包含偶数个 factor，奇数： 15有1，3，5， 15；
偶数 12 有 1 2 3 4 6 12； 唯一只有奇数次触发的灯将最终亮着，这样的数除了1和本身只存在一个factor出现一次，很容想到，应该是个平方数，比如9 1 3 9，这样的结果保证了最后灯泡将是点亮的。

我们的任务就简化为计算含有多少个平方数

总数n 的平方根即可

public class Solution {
    public int bulbSwitch(int n) {
        return (int)Math.sqrt(n); //注意输出结果应该是 int，所以需要转换类型
    }
}