zoukankan      html  css  js  c++  java
  • 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 i-th round, you toggle every i bulb. For the n-th round, you only toggle the last bulb. Find how many bulbs are on after n rounds.

    Example:

    Input: 3
    Output: 1
    Explanation:
    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.

    Solution1:(TLE) Brute Force

    class Solution:
        def bulbSwitch(self, n):
            """
            :type n: int
            :rtype: int
            """
            ans = [0 for _ in range(n)]
            def solve(i):
                start = i-1
                while start<n:
                    ans[start] = ~ans[start]
                    start += i
            for i in range(1,n+1):
                solve(i)
            return ans.count(-1)
    

    Solution2:

    class Solution:
        def bulbSwitch(self, n):
            """
            :type n: int
            :rtype: int
            """
            return int(n**0.5)
    
  • 相关阅读:
    HttpWebRequest后台读取网页类
    MD5加密方法
    Base64封装类
    3DES封装类
    C#操作XML类
    XML_Qt_资料
    XML_CPP_资料
    h.264_javascript_资料
    ffmpeg_资料_01
    QWebEngineView_简单例子_01
  • 原文地址:https://www.cnblogs.com/bernieloveslife/p/9782675.html
Copyright © 2011-2022 走看看