Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public class Solution {
- public int lengthOfLongestSubstring(String s) {
- int n = s.length(), ans = 0;
- Map<Character, Integer> map = new HashMap<>(); // current index of character
- // try to extend the range [i, j]
- for (int j = 0, i = 0; j < n; j++) {
- if (map.containsKey(s.charAt(j))) {
- i = Math.max(map.get(s.charAt(j)), i);
- }
- ans = Math.max(ans, j - i + 1);
- map.put(s.charAt(j), j + 1);
- }
- return ans;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement