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;
}
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 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
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.