leetcode 319 - Bulb Switcher

leetcode题目汇集 —  Bulb Switcher

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.

题目意思是第i次时，第ik（ik <= n）的灯泡会改变状态，即由亮变灭或由灭变亮。

解法1：

最简单粗暴的方法就穷举法，对每一次n，对应的i整数倍的灯泡状态改变一次，并对最终的灯泡状态进行计数。

注意，这种方法复杂度为o(n^2)，会出现Time Limit Exceeded

代码：

public class Solution {
    //穷举法，会超时
    public int bulbSwitch(int n) {
        boolean[] status = new boolean[n];
        for (int i = 1; i <= n; i++) {
            for (int j = 0; j < n; j++) {
                if ((j + 1) % i == 0) {
                    status[j] = !status[j];
                }
            }
        }
        int result = 0;
        for (int j = 0; j < n; j++) {
            if (status[j]) {
                result++;
            }
        }
        return result;
    }
}

解法2：

当n=6时，尝试列出所有状态

初始状态 [off off off off off off]

第一次:    [on on on on on on]

第二次： [on off on off on off]

第三次： [on off off off on on]

第四次:    [on off off on on on]

第五次:    [on off off on off on]

第六次:    [on off off on off off]

可以看到对第k个灯泡，当次数是k的因数时，灯泡状态会发生改变，经过六次变化后只有1,4两盏灯泡亮着，而1,4恰巧是完全平方数，那么这到底是否纯粹是巧合？

我们知道经过偶数次变换后灯泡状态相当于不变，经过奇数次变换后灯泡状态才发生改变，所以最终亮着的灯泡k满足条件：k的因数有奇数个。这样的k必然是完全平方数。

因此，题目相当于求1~n范围内完全平方数个数。

代码：

public class Solution {
    //相当于寻找1~n之间完全平方数的个数
    public int bulbSwitch(int n) {
        return (int)Math.sqrt(n);
    }
}