首页 > 其他 > 详细

672. Bulb Switcher II 灯泡切换器II

时间:2018-01-19 23:51:09      阅读:398      评论:0      收藏:0      [点我收藏+]

 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]

 





672. Bulb Switcher II 灯泡切换器II

原文:https://www.cnblogs.com/xiejunzhao/p/8319167.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!