Binary Gap LeetCode solution in Java

1
class Solution {
2
  public int binaryGap(int n) {
3
    char[] arr = Integer.toBinaryString(n).toCharArray();
4
    List<Integer> ans = new ArrayList();
5
    for (int i = 0; i < arr.length; i++) {
6
      if (arr[i] == '1') ans.add(i);
7
    }
8
    int res = 0;
9
    for (int i = 0; i < ans.size() - 1; i++) {
10
      res = Math.max(res, ans.get(i + 1) - ans.get(i));
11
    }
12
    return res;
13
  }
14
}