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

题目分析
1，自然数，如果是质数，只会有1和其自身，所以，只会走两次。结果为off
2，非质数又可以分为完全平方数和非完全平方数，非完全评书会有成对的因子出现，例如，2*3=6；所以会因为这些因子对的存在，做两次操作，两次操作就又回到了原来的位置。
3，所有的完全平方数，只做了一次操作，所以，找出所有的完全平方数即可。
4，完全平方数个数的求法。小于N的完全平方数的个数，为N的平方根

public class Solution {
    public int bulbSwitch(int n) {
        return (int)Math.sqrt(n);
        }
}