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”.
class Solution {
public:
vector<string> readBinaryWatch(int num) {
vector<string> ans;
char htable[4][5][3] = {"0", "", "", "", "",
"1", "2","4","8", "",
"3", "5", "9", "6", "10",
"7","11", "", "", "",
};
int hcol[] = {1, 4, 5, 2};
char mtable[6][20][3] = {"00","", "", "", "","", "", "", "","", "", "", "","", "", "", "","", "", "",
"01", "02", "04", "08", "16", "32","", "", "", "","", "", "", "","", "", "", "","", "",
"03", "05", "09", "17", "33", "06", "10", "18", "34", "12", "20", "36", "24", "40", "48","", "", "", "","",
"07", "11", "19", "35", "14", "22", "38", "28", "44", "13", "21", "37", "25", "26", "41", "42", "49", "50", "52", "56",
"15", "23", "39", "30", "46", "27", "29", "43", "45", "51", "53", "54", "58", "57", "", "", "","", "", "",
"31", "47", "55", "59", "", "", "", "","", "", "", "","", "", "", "","","", "", "",
};
int mcol[] = {1, 6, 15, 20, 14, 4};
if(num > 8 || num < 0) return ans;
for(int i = 0; i <= num; ++i){
if(i < 4){
for(int col = 0; col < hcol[i]; ++col){
string tmp(htable[i][col]);
if(num - i < 6){
for(int c = 0; c < mcol[num - i]; ++c){
string s = tmp + ":" + mtable[num - i][c];
ans.push_back(s);
}
}
}
}
}
return ans;
}
};