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.

题意就是，轮流开关灯泡，最简单就是直接遍历，但是肯定会超时，网上看到了一个做法，直接开根号，看到这个数学方法，才深知自己的智商再一次的被碾压了。

建议和leetcode 672. Bulb Switcher II 轮流开关灯泡 + 数学公式 一起学习

代码如下：

import java.util.Arrays;

/*
 * 本题的关键在于找完全平方数的个数。 
 * */
class Solution 
{
     public int bulbSwitch(int n) 
     {
         if(n<=0)
             return 0;
         else
             return (int)Math.sqrt((double)n);    
     }

    /*
     * 一般人都能想到的方法，但是会超时 
     * */
    public int bulbSwitchByBruteFource(int n) 
    {
        if(n<=0)
            return 0;
        boolean []bulb=new boolean[n];
        Arrays.fill(bulb, false);

        for(int i=0;i<n;i++)
        {
            for(int j=i;j<n;j=j+(1+i) )
            {
                bulb[j]=!bulb[j];
            }
        }

        int count=0;
        for(int i=0;i<n;i++)
        {
            if(bulb[i])
                count++;
        }
        return count;
    }
}

下面是C++的做法，就是轮流开开关，看到这么简单的做法，我也是震惊了，这道题的做法很棒，值得学习，

代码如下：

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <climits>
#include <algorithm>
#include <sstream>

using namespace std;


class Solution
{
public:
    int bulbSwitch(int n) 
    {
        if (n <= 0)
            return 0;
        else
            return (int)sqrt((double)n);
    }
};