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”.
Subscribe to see which companies asked this question
解法一:
因为只考虑一天的时间,所以可以直接操作:
只是代码比较拙计:
class Solution {
public:
vector<string> readBinaryWatch(int num) {
vector<string> ans;
int hour=0,hone=0;
int min=0,mone=0;
for(int hindex=0;hindex<=11;hindex++){
hone=numone(hindex);
if(hone<=4 && hone<=num){
for(int mindex=0;mindex<=59;mindex++){
mone=numone(mindex);
if(mone+hone==num){
string temp="";
temp+=to_string(hindex)+":";
if(mindex>=0&&mindex<=9){
temp+="0";
}
temp+=to_string(mindex);
ans.push_back(temp);
}
}
}
}
return ans;
}
int numone(int n){
int cnt=0;
while(n){
n=n&(n-1);
cnt++;
}
return cnt;
}
};
这样子比较慢,可以的一个优化的地方在于不必每次都遍历一次,用空间来保存一天中时间的1的个数
学了bit_set的用法,改进了一下代码:
class Solution {
public:
vector<string> readBinaryWatch(int num) {
vector<string> ans;
if(num<0 || num>10) return ans;
for(int hindex=0;hindex<12;hindex++){
bitset<4> h(hindex);
for(int mindex=0;mindex<60;mindex++){
bitset<6> m(mindex);
if(h.count()+m.count()==num){
string temp=to_string(hindex)+(mindex<10 ? ":0": ":")+to_string(mindex);
ans.push_back(temp);
}
}
}
return ans;
}
};
表示时间比之前的代码提高