Binary Gap LeetCode solution in JavaScript

1
var binaryGap = function (n) {
2
  var str = (n >>> 0).toString(2),
3
    start = 0,
4
    end = 0,
5
    diff = 0;
6
  for (var i = 0; i < str.length; i++) {
7
    if (str[i] === "1") {
8
      end = i;
9
      diff = Math.max(diff, end - start);
10
      start = i;
11
    }
12
  }
13
  return diff;
14
};