leetcode319. 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个灯泡开始都是关的。
第一次全部开
第二次每第二个按
第三次每第三个按
一次类推
问第n次后有多少灯是开的。

思路:画个简单的模拟图就很好说明了，首先我们的灯泡必须是按奇数次才是开的，而他有多少个质因数就会按多少次，质因数都是成对出现所以一般都是偶数，除非他可以完全开方质因数重复这样就会出现奇数的次数。所以我们找出完全平方的个数就Ok了代码如下:

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