Bulb Switcher灯泡开关问题----Medium

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.

有N个灯泡初始化为off，第一轮让所有灯泡都变为on，第二轮让每次第二个的灯泡变为off，第三轮让每个第三个灯泡改变原来状态(原来是off改为on，原来是on改为off)。第N轮，你只用改变最后一个灯泡。求在N轮后有多少灯泡是on状态。

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=4

初始化，四个灯泡 [on, on ,on ,on]

第一轮，四个灯泡 [off, off ,off ,off]

第二轮，四个灯泡 [on, off ,on ,off]

第三轮，四个灯泡 [on, off ,off ,off]

第四轮，四个灯泡 [on, off ,off ,on]

答案：根据分析

1~3 => 1

4~8 => 2

9~15 => 3

16~24 =>4

规律是平方根

int bulbSwitch(int n) {
   return sqrt(n);
}

摘自：https://leetcode.com/problems/bulb-switcher/