LeetCode #401 - Binary Watch

题目描述：

A binary watch has 4 LEDs on the top which represent the hours (0-11), and the 6 LEDs on the bottom represent the minutes (0-59).

Each LED represents a zero or one, with the least significant bit on the right.

For example, the above binary watch reads "3:25".

Given a non-negative integer n which represents the number of LEDs that are currently on, return all possible times the watch could represent.

Example:

Input: n = 1
Return: ["1:00", "2:00", "4:00", "8:00", "0:01", "0:02", "0:04", "0:08", "0:16", "0:32"]

Note:

• The order of output does not matter.
• The hour must not contain a leading zero, for example "01:00" is not valid, it should be "1:00".
• The minute must be consist of two digits and may contain a leading zero, for example "10:2" is not valid, it should be "10:02".

对于二进制表，如果有n个灯亮着，求出表示的所有可能时间。这道题显然是运用递归，将给定数目分为时钟灯数和分钟灯数，利用递归获得可能的时钟数和分钟数，再进行组合。

class Solution {
public:
    vector<string> readBinaryWatch(int num) {
        vector<string> result;
        if(num>10) return result;
        vector<int> hours{1,2,4,8};
        vector<int> minutes{1,2,4,8,16,32};
        for(int i=0;i<=4;i++)
        {
            int j=num-i;
            if(j<0||j>6) continue;
            vector<int> h;
            vector<int> m;
            getHour(i,hours,0,0,h);
            getMinute(j,minutes,0,0,m);
            for(int p=0;p<h.size();p++)
            {
                for(int q=0;q<m.size();q++)
                {
                    string a=to_string(h[p]);
                    string b=to_string(m[q]);
                    if(m[q]<10) b="0"+b;
                    result.push_back(a+":"+b);
                }
            }
        }
        return result;
    }
    
    void getHour(int n, vector<int> hours, int sum, int i, vector<int>& h)
    {
        if(sum>11) return;
        if(n==0)
        {
            h.push_back(sum);
            return;
        }
        if(i==4) return;
        getHour(n,hours,sum,i+1,h);
        sum+=hours[i];
        getHour(n-1,hours,sum,i+1,h);
    }
    
    void getMinute(int n, vector<int> minutes, int sum, int i, vector<int>& m)
    {
        if(sum>59) return;
        if(n==0)
        {
            m.push_back(sum);
            return;
        }
        if(i==6) return;
        getMinute(n,minutes,sum,i+1,m);
        sum+=minutes[i];
        getMinute(n-1,minutes,sum,i+1,m);
    }
};