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

分析：

一、最开始想到的是用两个循环，找出每一个数的因数，但是会超时；

二、数学分析，列举多个例子找规律，然后再分析为什么是这个规律：n开平方。因为当i的因数数为奇数时，灯泡为on，而只有在i是某个数的平方时，才会出现奇数个因数，否则肯定是成对出现的，那么要找出所有亮着的灯泡数目，只需要找出小于等于n的整数中有几个是某数的平方，可等效为n的平方根。