672. Bulb Switcher 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].

思路：先考虑没有3k+1情况，搞清楚只有三种情况下后，加入3k+1

代码1：

class Solution {
public:
    int flipLights(int n, int m) {
        if(m==0){return 1;}
        if(n<2){
            if(m%2){return 2;}
            else {return 2;}
        }
        else if(n<3){
            if(m%2){return 3;}
            else{return 4;}
        }//n<4, operation 4 is equal to operation 1
        else{
            if(m==1){return 4;}
            else if(m==2){return 7;}
            else {return 8;}
        }
    }
};

代码2：

class Solution {
public:
    int flipLights(int n, int m) {
        if (m == 0 || n == 0) return 1;
        if (n == 1) return 2;
        if (n == 2) return m == 1? 3:4;
        if (m == 1) return 4;
        return m == 2? 7:8;
    }
};