(n: i32)
| 1 | pub fn binary_gap(n: i32) -> i32 { |
| 2 | let bin_chars: Vec<char> = format!("{:b}", n).chars().collect(); |
| 3 | let mut one_arr = vec!(); |
| 4 | for (i, c) in bin_chars.iter().enumerate() { |
| 5 | if c == &'1' { |
| 6 | one_arr.push(i); |
| 7 | } |
| 8 | } |
| 9 | if &one_arr.len() < &2 { |
| 10 | 0 |
| 11 | } else { |
| 12 | let mut minus_arr = vec!(); |
| 13 | for i in 1..one_arr.len() { |
| 14 | minus_arr.push(one_arr[i] - one_arr[i-1]); |
| 15 | } |
| 16 | *minus_arr.iter().max().unwrap() as i32 |
| 17 | } |
| 18 | } |
| 19 | |
| 20 | fn main() { |
| 21 | println!("{:?}", binary_gap(22)); |