forked from anishLearnsToCode/leetcode-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinaryWatch.java
39 lines (31 loc) · 939 Bytes
/
BinaryWatch.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
import java.util.ArrayList;
import java.util.List;
public class BinaryWatch {
public List<String> readBinaryWatch(int num) {
List<String> result = new ArrayList<String>();
for(int i = 0 ; i < 12 ; i++){
for(int j=0 ; j < 60 ; j++){
int total = countDigits(i) + countDigits(j);
if(total == num){
StringBuilder time = new StringBuilder();
time.append(i)
.append(":")
.append(j < 10 ? 0 : "")
.append(j);
result.add(time.toString());
}
}
}
return result;
}
public int countDigits(int num){
int result = 0;
while(num > 0){
if((num & 1) == 1){
result++;
}
num >>= 1;
}
return result;
}
}