zoukankan      html  css  js  c++  java
  • 672. Bulb Switcher II 灯泡切换器II

     There is a room with n lights which are turned on initially and 4 buttons on the wall. After performing exactly m unknown operations towards buttons, you need to return how many different kinds of status of the n lights could be.

    Suppose n lights are labeled as number [1, 2, 3 ..., n], function of these 4 buttons are given below:

    1. Flip all the lights.
    2. Flip lights with even numbers.
    3. Flip lights with odd numbers.
    4. Flip lights with (3k + 1) numbers, k = 0, 1, 2, ...

    Example 1:

    Input: n = 1, m = 1.
    Output: 2
    Explanation: Status can be: [on], [off]
    

    Example 2:

    Input: n = 2, m = 1.
    Output: 3
    Explanation: Status can be: [on, off], [off, on], [off, off]
    

    Example 3:

    Input: n = 3, m = 1.
    Output: 4
    Explanation: Status can be: [off, on, off], [on, off, on], [off, off, off], [off, on, on].
    

    Note:n and m both fit in range [0, 1000].



    1. class Solution:
    2. def flipLights(self, n, m):
    3. """
    4. :type n: int
    5. :type m: int
    6. :rtype: int
    7. """
    8. n = min(n, 3)
    9. if m == 0: return 1
    10. if m == 1: return [2, 3, 4][n-1]
    11. if m == 2: return [2, 4, 7][n-1]
    12. return [2, 4, 8][n-1]





  • 相关阅读:
    Ajax基本用法
    浏览器兼容性问题
    对闭包的简单理解
    JSON
    Ajax知识
    对jsonp原理理解
    java Active Object模式(上)
    物联网传输协议MQTT
    谈谈如何在面试中发掘程序猿的核心竞争力
    响应式Web设计的9项基本原则
  • 原文地址:https://www.cnblogs.com/xiejunzhao/p/8319167.html
Copyright © 2011-2022 走看看