[LeetCode][JavaScript]Bulb Switcher

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.

https://leetcode.com/problems/bulb-switcher/

一看就是数学题，搞个数组去模拟肯定TLE，有大数，需要找规律。

像我这种数学拙计的选手，就是死算，从1推到10应该就能看出规律了，所有剩下的灯泡都是平方数1, 4, 9。

看看大神的解释：

https://leetcode.com/discuss/75014/math-solution

我的理解是，比如12可以拆成1和12， 2和6， 3和4，他们两两之间碰不到，或者碰到奇数次，最后是关的。

而像10, 11这种只可能碰到一次，最后是关的。

如果是平方数比如9，3的时候关了，9的时候又会打开，所以最后是打开的。

1 /**
2  * @param {number} n
3  * @return {number}
4  */
5 var bulbSwitch = function(n) {
6     return parseInt(Math.sqrt(n));
7 };