Longest Substring Without Repeating Characters LeetCode solution in Java

1
class Solution {
2
  public int lengthOfLongestSubstring(String s) {
3
    Map<Character, Integer> hash = new HashMap<>();
4
    int count = 0;
5
    int ans = 0;
6
    for (int i = 0; i < s.length(); i++) {
7
      if (hash.containsKey(s.charAt(i))) {
8
        i = hash.get(s.charAt(i)) + 1;
9
        hash.clear();
10
        count = 0;
11
      }
12
      if (!hash.containsKey(s.charAt(i))) {
13
        hash.put(s.charAt(i), i);
14
        count++;
15
        ans = Math.max(ans, count);
16
      }
17
    }
18
    return ans;
19
  }
20
}