I was solving TCO 2015 and saw this code, someone knows it for?
public static int getMask(int n){
return n != 0 ? 1 << n % 10 | getMask(n / 10) : 0;
}
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
8 | SecondThread | 146 |
10 | pajenegod | 145 |
I was solving TCO 2015 and saw this code, someone knows it for?
public static int getMask(int n){
return n != 0 ? 1 << n % 10 | getMask(n / 10) : 0;
}
Name |
---|
the method build a set where the k-th bit is 1 if the the digit k appears in N, 0 <= k <= 9.
Example, N = 42594 getMask(N) = 1000110100 in binary, notice that the rightmost bit represents the status of the digit 0.